./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 790ee47547867d006f1299e2cf5c9d6d26b057091574ae3950813e98f75c3c5e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:50:05,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:50:05,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:50:05,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:50:05,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:50:05,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:50:05,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:50:05,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:50:05,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:50:05,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:50:05,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:50:05,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:50:05,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:50:05,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:50:05,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:50:05,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:50:05,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:50:05,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:50:05,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:50:05,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:50:05,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:50:05,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:50:05,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:50:05,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:50:05,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:50:05,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:50:05,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:50:05,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:50:05,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:50:05,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:50:05,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:50:05,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:50:05,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:50:05,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:50:05,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:50:05,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:50:05,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:50:05,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:50:05,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:50:05,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:50:05,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:50:05,637 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:50:05,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:50:05,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:50:05,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:50:05,677 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:50:05,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:50:05,678 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:50:05,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:50:05,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:50:05,679 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:50:05,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:50:05,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:50:05,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:50:05,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:50:05,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:50:05,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:50:05,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:50:05,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:50:05,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:50:05,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:50:05,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:50:05,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:50:05,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:05,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:50:05,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:50:05,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:50:05,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:50:05,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:50:05,685 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:50:05,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:50:05,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:50:05,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 790ee47547867d006f1299e2cf5c9d6d26b057091574ae3950813e98f75c3c5e [2022-11-02 20:50:06,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:50:06,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:50:06,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:50:06,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:50:06,092 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:50:06,094 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i [2022-11-02 20:50:06,174 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/data/630eb32d1/580e5c12e41e4c809070df69db2b799c/FLAGe3235af23 [2022-11-02 20:50:06,967 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:50:06,968 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i [2022-11-02 20:50:07,008 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/data/630eb32d1/580e5c12e41e4c809070df69db2b799c/FLAGe3235af23 [2022-11-02 20:50:07,494 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/data/630eb32d1/580e5c12e41e4c809070df69db2b799c [2022-11-02 20:50:07,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:50:07,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:50:07,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:07,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:50:07,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:50:07,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:07" (1/1) ... [2022-11-02 20:50:07,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c250c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:07, skipping insertion in model container [2022-11-02 20:50:07,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:07" (1/1) ... [2022-11-02 20:50:07,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:50:07,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:50:08,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i[152029,152042] [2022-11-02 20:50:08,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:08,906 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:50:09,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i[152029,152042] [2022-11-02 20:50:09,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:09,303 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:50:09,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09 WrapperNode [2022-11-02 20:50:09,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:09,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:09,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:50:09,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:50:09,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,503 INFO L138 Inliner]: procedures = 134, calls = 555, calls flagged for inlining = 53, calls inlined = 50, statements flattened = 1647 [2022-11-02 20:50:09,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:09,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:50:09,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:50:09,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:50:09,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,677 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:50:09,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:50:09,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:50:09,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:50:09,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (1/1) ... [2022-11-02 20:50:09,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:09,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:09,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:09,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:50:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_hard_header [2022-11-02 20:50:09,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_hard_header [2022-11-02 20:50:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-02 20:50:09,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-02 20:50:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_rx [2022-11-02 20:50:09,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_rx [2022-11-02 20:50:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:50:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_type_trans [2022-11-02 20:50:09,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_type_trans [2022-11-02 20:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-11-02 20:50:09,806 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-11-02 20:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:50:09,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:50:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:50:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-11-02 20:50:09,807 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-11-02 20:50:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:50:09,808 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:50:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_disconnect_3 [2022-11-02 20:50:09,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_disconnect_3 [2022-11-02 20:50:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:50:09,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:50:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure netif_dormant_on [2022-11-02 20:50:09,809 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_dormant_on [2022-11-02 20:50:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-11-02 20:50:09,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-11-02 20:50:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:50:09,809 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:50:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:50:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:50:09,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:50:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_tx_flush [2022-11-02 20:50:09,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_tx_flush [2022-11-02 20:50:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-11-02 20:50:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-11-02 20:50:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:50:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:50:09,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:50:09,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:50:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:50:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-02 20:50:09,812 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-02 20:50:09,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:50:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure get_ppp [2022-11-02 20:50:09,813 INFO L138 BoogieDeclarations]: Found implementation of procedure get_ppp [2022-11-02 20:50:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:50:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:50:09,813 INFO L130 BoogieDeclarations]: Found specification of procedure get_proto [2022-11-02 20:50:09,814 INFO L138 BoogieDeclarations]: Found implementation of procedure get_proto [2022-11-02 20:50:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-02 20:50:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-11-02 20:50:09,814 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-11-02 20:50:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_tx_cp [2022-11-02 20:50:09,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_tx_cp [2022-11-02 20:50:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:50:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-02 20:50:09,815 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-02 20:50:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-02 20:50:09,816 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-02 20:50:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:50:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:50:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_cp_event [2022-11-02 20:50:09,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_cp_event [2022-11-02 20:50:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-02 20:50:09,817 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-02 20:50:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-02 20:50:09,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-02 20:50:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-11-02 20:50:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-11-02 20:50:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_ioctl [2022-11-02 20:50:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_ioctl [2022-11-02 20:50:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure proto_name [2022-11-02 20:50:09,819 INFO L138 BoogieDeclarations]: Found implementation of procedure proto_name [2022-11-02 20:50:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:50:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure linkwatch_fire_event [2022-11-02 20:50:09,819 INFO L138 BoogieDeclarations]: Found implementation of procedure linkwatch_fire_event [2022-11-02 20:50:09,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:50:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 20:50:09,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 20:50:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:50:09,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:50:10,318 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:50:10,322 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:50:11,263 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:50:12,798 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:50:12,816 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:50:12,817 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:50:12,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:12 BoogieIcfgContainer [2022-11-02 20:50:12,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:50:12,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:50:12,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:50:12,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:50:12,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:50:07" (1/3) ... [2022-11-02 20:50:12,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdf1f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:12, skipping insertion in model container [2022-11-02 20:50:12,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:09" (2/3) ... [2022-11-02 20:50:12,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdf1f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:12, skipping insertion in model container [2022-11-02 20:50:12,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:12" (3/3) ... [2022-11-02 20:50:12,834 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i [2022-11-02 20:50:12,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:50:12,862 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:50:12,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:50:12,996 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78eee451, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:50:12,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:50:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 593 states, 433 states have (on average 1.4133949191685913) internal successors, (612), 454 states have internal predecessors, (612), 126 states have call successors, (126), 33 states have call predecessors, (126), 32 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2022-11-02 20:50:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:50:13,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:13,031 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:13,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:13,039 INFO L85 PathProgramCache]: Analyzing trace with hash 461964592, now seen corresponding path program 1 times [2022-11-02 20:50:13,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:13,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117000653] [2022-11-02 20:50:13,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:13,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:13,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:13,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:50:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:50:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:13,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:50:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:13,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:50:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 20:50:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:13,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117000653] [2022-11-02 20:50:13,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117000653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:13,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:13,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:50:13,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620525781] [2022-11-02 20:50:13,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:13,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:50:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:13,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:50:13,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:13,709 INFO L87 Difference]: Start difference. First operand has 593 states, 433 states have (on average 1.4133949191685913) internal successors, (612), 454 states have internal predecessors, (612), 126 states have call successors, (126), 33 states have call predecessors, (126), 32 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:16,333 INFO L93 Difference]: Finished difference Result 1924 states and 3013 transitions. [2022-11-02 20:50:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-11-02 20:50:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:16,391 INFO L225 Difference]: With dead ends: 1924 [2022-11-02 20:50:16,391 INFO L226 Difference]: Without dead ends: 1316 [2022-11-02 20:50:16,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:16,447 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1221 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:16,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 2175 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:50:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-11-02 20:50:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1124. [2022-11-02 20:50:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 827 states have (on average 1.4014510278113663) internal successors, (1159), 857 states have internal predecessors, (1159), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 20:50:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1626 transitions. [2022-11-02 20:50:16,648 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1626 transitions. Word has length 47 [2022-11-02 20:50:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:16,650 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1626 transitions. [2022-11-02 20:50:16,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:50:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1626 transitions. [2022-11-02 20:50:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:50:16,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:16,666 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:16,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:50:16,667 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash -203116028, now seen corresponding path program 1 times [2022-11-02 20:50:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:16,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810050646] [2022-11-02 20:50:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:17,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:50:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:17,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:50:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:50:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:50:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:17,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:50:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:17,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:50:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 20:50:17,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:17,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810050646] [2022-11-02 20:50:17,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810050646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:17,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:17,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107191194] [2022-11-02 20:50:17,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:17,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:17,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:17,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:17,060 INFO L87 Difference]: Start difference. First operand 1124 states and 1626 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-02 20:50:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:19,292 INFO L93 Difference]: Finished difference Result 2425 states and 3576 transitions. [2022-11-02 20:50:19,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:19,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-11-02 20:50:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:19,318 INFO L225 Difference]: With dead ends: 2425 [2022-11-02 20:50:19,318 INFO L226 Difference]: Without dead ends: 1315 [2022-11-02 20:50:19,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:19,331 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 1214 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:19,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 2352 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-02 20:50:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2022-11-02 20:50:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1123. [2022-11-02 20:50:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 826 states have (on average 1.3983050847457628) internal successors, (1155), 856 states have internal predecessors, (1155), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-02 20:50:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1622 transitions. [2022-11-02 20:50:19,452 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1622 transitions. Word has length 62 [2022-11-02 20:50:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:19,453 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1622 transitions. [2022-11-02 20:50:19,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-02 20:50:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1622 transitions. [2022-11-02 20:50:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:50:19,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:19,459 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:19,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:50:19,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1442675309, now seen corresponding path program 1 times [2022-11-02 20:50:19,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:19,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103299089] [2022-11-02 20:50:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:19,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:19,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:19,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:50:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:50:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:19,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:50:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:19,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:50:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:50:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:19,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:50:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:50:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:20,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:50:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-02 20:50:20,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:20,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103299089] [2022-11-02 20:50:20,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103299089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:20,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:20,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:50:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583891815] [2022-11-02 20:50:20,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:20,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:50:20,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:20,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:50:20,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:20,051 INFO L87 Difference]: Start difference. First operand 1123 states and 1622 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:50:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:23,243 INFO L93 Difference]: Finished difference Result 3722 states and 5707 transitions. [2022-11-02 20:50:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:50:23,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-11-02 20:50:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:23,279 INFO L225 Difference]: With dead ends: 3722 [2022-11-02 20:50:23,279 INFO L226 Difference]: Without dead ends: 2608 [2022-11-02 20:50:23,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:50:23,296 INFO L413 NwaCegarLoop]: 963 mSDtfsCounter, 1212 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 3799 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:23,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 3799 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 20:50:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2022-11-02 20:50:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2370. [2022-11-02 20:50:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 1755 states have (on average 1.4062678062678062) internal successors, (2468), 1821 states have internal predecessors, (2468), 478 states have call successors, (478), 125 states have call predecessors, (478), 136 states have return successors, (599), 455 states have call predecessors, (599), 477 states have call successors, (599) [2022-11-02 20:50:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3545 transitions. [2022-11-02 20:50:23,526 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3545 transitions. Word has length 83 [2022-11-02 20:50:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:23,527 INFO L495 AbstractCegarLoop]: Abstraction has 2370 states and 3545 transitions. [2022-11-02 20:50:23,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:50:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3545 transitions. [2022-11-02 20:50:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-02 20:50:23,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:23,541 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:23,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:50:23,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:23,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:23,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1545482870, now seen corresponding path program 1 times [2022-11-02 20:50:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:23,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871146531] [2022-11-02 20:50:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:50:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:50:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:50:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:50:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:50:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:50:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:50:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:50:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:50:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-02 20:50:23,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:23,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871146531] [2022-11-02 20:50:23,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871146531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:23,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:23,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:23,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523207603] [2022-11-02 20:50:23,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:23,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:23,867 INFO L87 Difference]: Start difference. First operand 2370 states and 3545 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 20:50:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:26,144 INFO L93 Difference]: Finished difference Result 4998 states and 7343 transitions. [2022-11-02 20:50:26,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:26,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2022-11-02 20:50:26,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:26,176 INFO L225 Difference]: With dead ends: 4998 [2022-11-02 20:50:26,176 INFO L226 Difference]: Without dead ends: 2642 [2022-11-02 20:50:26,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:26,201 INFO L413 NwaCegarLoop]: 880 mSDtfsCounter, 977 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:26,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1914 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-02 20:50:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2022-11-02 20:50:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2411. [2022-11-02 20:50:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 1782 states have (on average 1.361391694725028) internal successors, (2426), 1849 states have internal predecessors, (2426), 454 states have call successors, (454), 163 states have call predecessors, (454), 174 states have return successors, (561), 442 states have call predecessors, (561), 453 states have call successors, (561) [2022-11-02 20:50:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3441 transitions. [2022-11-02 20:50:26,475 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3441 transitions. Word has length 119 [2022-11-02 20:50:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:26,475 INFO L495 AbstractCegarLoop]: Abstraction has 2411 states and 3441 transitions. [2022-11-02 20:50:26,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 20:50:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3441 transitions. [2022-11-02 20:50:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-02 20:50:26,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:26,491 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:26,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:50:26,495 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1893256586, now seen corresponding path program 2 times [2022-11-02 20:50:26,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:26,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895858271] [2022-11-02 20:50:26,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:26,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:50:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:50:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:50:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:50:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:50:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:50:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:50:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:50:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:50:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-02 20:50:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:26,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895858271] [2022-11-02 20:50:26,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895858271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:26,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:26,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11982970] [2022-11-02 20:50:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:26,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:26,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:26,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:26,823 INFO L87 Difference]: Start difference. First operand 2411 states and 3441 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-02 20:50:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:30,625 INFO L93 Difference]: Finished difference Result 5630 states and 8219 transitions. [2022-11-02 20:50:30,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:30,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2022-11-02 20:50:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:30,669 INFO L225 Difference]: With dead ends: 5630 [2022-11-02 20:50:30,669 INFO L226 Difference]: Without dead ends: 3820 [2022-11-02 20:50:30,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:30,687 INFO L413 NwaCegarLoop]: 1242 mSDtfsCounter, 982 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 3038 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:30,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 3038 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:50:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2022-11-02 20:50:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3462. [2022-11-02 20:50:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3462 states, 2581 states have (on average 1.3684618364974817) internal successors, (3532), 2681 states have internal predecessors, (3532), 640 states have call successors, (640), 223 states have call predecessors, (640), 240 states have return successors, (793), 617 states have call predecessors, (793), 639 states have call successors, (793) [2022-11-02 20:50:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 4965 transitions. [2022-11-02 20:50:31,063 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 4965 transitions. Word has length 119 [2022-11-02 20:50:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:31,064 INFO L495 AbstractCegarLoop]: Abstraction has 3462 states and 4965 transitions. [2022-11-02 20:50:31,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-02 20:50:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 4965 transitions. [2022-11-02 20:50:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:50:31,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:31,078 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:31,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:50:31,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:31,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:31,079 INFO L85 PathProgramCache]: Analyzing trace with hash 528219514, now seen corresponding path program 1 times [2022-11-02 20:50:31,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:31,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141759] [2022-11-02 20:50:31,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:50:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:50:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:50:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:50:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:50:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:50:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:50:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:50:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 20:50:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-02 20:50:31,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:31,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141759] [2022-11-02 20:50:31,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:31,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:31,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305556199] [2022-11-02 20:50:31,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:31,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:31,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:31,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:31,412 INFO L87 Difference]: Start difference. First operand 3462 states and 4965 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 20:50:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:35,362 INFO L93 Difference]: Finished difference Result 7855 states and 11473 transitions. [2022-11-02 20:50:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:35,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 136 [2022-11-02 20:50:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:35,409 INFO L225 Difference]: With dead ends: 7855 [2022-11-02 20:50:35,409 INFO L226 Difference]: Without dead ends: 4994 [2022-11-02 20:50:35,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:35,436 INFO L413 NwaCegarLoop]: 1552 mSDtfsCounter, 1078 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:35,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 2933 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-02 20:50:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2022-11-02 20:50:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4517. [2022-11-02 20:50:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 3382 states have (on average 1.3719692489651094) internal successors, (4640), 3515 states have internal predecessors, (4640), 826 states have call successors, (826), 285 states have call predecessors, (826), 308 states have return successors, (1025), 792 states have call predecessors, (1025), 825 states have call successors, (1025) [2022-11-02 20:50:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6491 transitions. [2022-11-02 20:50:35,827 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6491 transitions. Word has length 136 [2022-11-02 20:50:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:35,829 INFO L495 AbstractCegarLoop]: Abstraction has 4517 states and 6491 transitions. [2022-11-02 20:50:35,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 20:50:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6491 transitions. [2022-11-02 20:50:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-02 20:50:35,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:35,841 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:35,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:50:35,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1586883258, now seen corresponding path program 1 times [2022-11-02 20:50:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:35,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944748143] [2022-11-02 20:50:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:50:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:50:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:50:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:50:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:50:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:50:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:50:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:50:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:50:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:50:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:50:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:50:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:50:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-02 20:50:36,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:36,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944748143] [2022-11-02 20:50:36,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944748143] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:36,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557100869] [2022-11-02 20:50:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:36,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:36,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:36,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:36,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:50:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:50:37,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-02 20:50:37,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:50:37,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557100869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:37,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:50:37,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-02 20:50:37,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563418218] [2022-11-02 20:50:37,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:37,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:37,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:37,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:37,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:50:37,209 INFO L87 Difference]: Start difference. First operand 4517 states and 6491 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:50:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:37,550 INFO L93 Difference]: Finished difference Result 9714 states and 14031 transitions. [2022-11-02 20:50:37,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:37,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2022-11-02 20:50:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:37,591 INFO L225 Difference]: With dead ends: 9714 [2022-11-02 20:50:37,592 INFO L226 Difference]: Without dead ends: 5211 [2022-11-02 20:50:37,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:50:37,621 INFO L413 NwaCegarLoop]: 1037 mSDtfsCounter, 167 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:37,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1869 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:50:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states. [2022-11-02 20:50:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 4577. [2022-11-02 20:50:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 3442 states have (on average 1.3654851830331203) internal successors, (4700), 3575 states have internal predecessors, (4700), 826 states have call successors, (826), 285 states have call predecessors, (826), 308 states have return successors, (1025), 792 states have call predecessors, (1025), 825 states have call successors, (1025) [2022-11-02 20:50:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6551 transitions. [2022-11-02 20:50:37,983 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6551 transitions. Word has length 147 [2022-11-02 20:50:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:37,983 INFO L495 AbstractCegarLoop]: Abstraction has 4577 states and 6551 transitions. [2022-11-02 20:50:37,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:50:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6551 transitions. [2022-11-02 20:50:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-02 20:50:37,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:37,992 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:38,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:38,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 20:50:38,212 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2106356288, now seen corresponding path program 1 times [2022-11-02 20:50:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:38,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751747840] [2022-11-02 20:50:38,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:38,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:50:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:50:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:50:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:50:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:50:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:50:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:50:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:50:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:50:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:50:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:50:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:50:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:50:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-02 20:50:38,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:38,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751747840] [2022-11-02 20:50:38,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751747840] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:38,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902960220] [2022-11-02 20:50:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:38,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:38,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:38,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:38,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:50:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:39,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:50:39,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-02 20:50:39,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:50:39,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902960220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:39,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:50:39,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-02 20:50:39,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890514748] [2022-11-02 20:50:39,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:39,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:39,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:39,395 INFO L87 Difference]: Start difference. First operand 4577 states and 6551 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:50:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:39,684 INFO L93 Difference]: Finished difference Result 9150 states and 13556 transitions. [2022-11-02 20:50:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:39,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2022-11-02 20:50:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:39,739 INFO L225 Difference]: With dead ends: 9150 [2022-11-02 20:50:39,739 INFO L226 Difference]: Without dead ends: 4587 [2022-11-02 20:50:39,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:39,772 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 2 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3319 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:39,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3319 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:50:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2022-11-02 20:50:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4577. [2022-11-02 20:50:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 3432 states have (on average 1.3607226107226107) internal successors, (4670), 3570 states have internal predecessors, (4670), 826 states have call successors, (826), 285 states have call predecessors, (826), 318 states have return successors, (1052), 797 states have call predecessors, (1052), 825 states have call successors, (1052) [2022-11-02 20:50:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6548 transitions. [2022-11-02 20:50:40,199 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6548 transitions. Word has length 147 [2022-11-02 20:50:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:40,199 INFO L495 AbstractCegarLoop]: Abstraction has 4577 states and 6548 transitions. [2022-11-02 20:50:40,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:50:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6548 transitions. [2022-11-02 20:50:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-02 20:50:40,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:40,210 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:40,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:40,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:40,431 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:40,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:40,431 INFO L85 PathProgramCache]: Analyzing trace with hash 852351328, now seen corresponding path program 1 times [2022-11-02 20:50:40,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:40,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247972783] [2022-11-02 20:50:40,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:50:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:50:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:50:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:50:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:50:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:50:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:50:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:50:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:50:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:50:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:50:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:50:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:50:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:41,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:42,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:42,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:50:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-02 20:50:42,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:42,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247972783] [2022-11-02 20:50:42,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247972783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:42,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:42,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-02 20:50:42,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185152493] [2022-11-02 20:50:42,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:42,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:50:42,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:42,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:50:42,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:50:42,442 INFO L87 Difference]: Start difference. First operand 4577 states and 6548 transitions. Second operand has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 11 states have internal predecessors, (95), 3 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:50:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:48,318 INFO L93 Difference]: Finished difference Result 9629 states and 14338 transitions. [2022-11-02 20:50:48,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:50:48,319 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 11 states have internal predecessors, (95), 3 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) Word has length 154 [2022-11-02 20:50:48,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:48,385 INFO L225 Difference]: With dead ends: 9629 [2022-11-02 20:50:48,386 INFO L226 Difference]: Without dead ends: 5066 [2022-11-02 20:50:48,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:50:48,446 INFO L413 NwaCegarLoop]: 878 mSDtfsCounter, 210 mSDsluCounter, 8745 mSDsCounter, 0 mSdLazyCounter, 3103 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 9623 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 3103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:48,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 9623 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 3103 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-11-02 20:50:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2022-11-02 20:50:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 4607. [2022-11-02 20:50:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4607 states, 3462 states have (on average 1.3547082611207395) internal successors, (4690), 3590 states have internal predecessors, (4690), 826 states have call successors, (826), 285 states have call predecessors, (826), 318 states have return successors, (1047), 807 states have call predecessors, (1047), 825 states have call successors, (1047) [2022-11-02 20:50:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 6563 transitions. [2022-11-02 20:50:49,004 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 6563 transitions. Word has length 154 [2022-11-02 20:50:49,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:49,005 INFO L495 AbstractCegarLoop]: Abstraction has 4607 states and 6563 transitions. [2022-11-02 20:50:49,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 11 states have internal predecessors, (95), 3 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:50:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 6563 transitions. [2022-11-02 20:50:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-02 20:50:49,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:49,028 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:49,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:50:49,028 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:49,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash -145558883, now seen corresponding path program 1 times [2022-11-02 20:50:49,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:49,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083479386] [2022-11-02 20:50:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:49,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:49,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:49,471 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:50:49,472 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:50:49,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:50:49,480 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:49,486 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:50:49,560 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:50:49 BoogieIcfgContainer [2022-11-02 20:50:49,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:50:49,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:50:49,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:50:49,742 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:50:49,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:12" (3/4) ... [2022-11-02 20:50:49,744 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:50:49,764 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,764 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,765 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,765 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,765 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,766 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,766 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,766 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,766 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,766 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-02 20:50:49,933 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:50:49,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:50:49,935 INFO L158 Benchmark]: Toolchain (without parser) took 42435.77ms. Allocated memory was 111.1MB in the beginning and 614.5MB in the end (delta: 503.3MB). Free memory was 64.5MB in the beginning and 303.0MB in the end (delta: -238.5MB). Peak memory consumption was 264.2MB. Max. memory is 16.1GB. [2022-11-02 20:50:49,935 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 111.1MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:50:49,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1802.88ms. Allocated memory was 111.1MB in the beginning and 153.1MB in the end (delta: 41.9MB). Free memory was 64.3MB in the beginning and 86.6MB in the end (delta: -22.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-11-02 20:50:49,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 196.89ms. Allocated memory is still 153.1MB. Free memory was 86.6MB in the beginning and 76.8MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:50:49,937 INFO L158 Benchmark]: Boogie Preprocessor took 194.74ms. Allocated memory is still 153.1MB. Free memory was 76.8MB in the beginning and 100.1MB in the end (delta: -23.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-11-02 20:50:49,940 INFO L158 Benchmark]: RCFGBuilder took 3121.52ms. Allocated memory was 153.1MB in the beginning and 257.9MB in the end (delta: 104.9MB). Free memory was 99.4MB in the beginning and 191.5MB in the end (delta: -92.1MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2022-11-02 20:50:49,941 INFO L158 Benchmark]: TraceAbstraction took 36917.23ms. Allocated memory was 257.9MB in the beginning and 614.5MB in the end (delta: 356.5MB). Free memory was 191.5MB in the beginning and 341.8MB in the end (delta: -150.3MB). Peak memory consumption was 207.3MB. Max. memory is 16.1GB. [2022-11-02 20:50:49,941 INFO L158 Benchmark]: Witness Printer took 192.98ms. Allocated memory is still 614.5MB. Free memory was 341.8MB in the beginning and 303.0MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-02 20:50:49,944 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 111.1MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1802.88ms. Allocated memory was 111.1MB in the beginning and 153.1MB in the end (delta: 41.9MB). Free memory was 64.3MB in the beginning and 86.6MB in the end (delta: -22.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 196.89ms. Allocated memory is still 153.1MB. Free memory was 86.6MB in the beginning and 76.8MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 194.74ms. Allocated memory is still 153.1MB. Free memory was 76.8MB in the beginning and 100.1MB in the end (delta: -23.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * RCFGBuilder took 3121.52ms. Allocated memory was 153.1MB in the beginning and 257.9MB in the end (delta: 104.9MB). Free memory was 99.4MB in the beginning and 191.5MB in the end (delta: -92.1MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * TraceAbstraction took 36917.23ms. Allocated memory was 257.9MB in the beginning and 614.5MB in the end (delta: 356.5MB). Free memory was 191.5MB in the beginning and 341.8MB in the end (delta: -150.3MB). Peak memory consumption was 207.3MB. Max. memory is 16.1GB. * Witness Printer took 192.98ms. Allocated memory is still 614.5MB. Free memory was 341.8MB in the beginning and 303.0MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 5283]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L5306] int LDV_IN_INTERRUPT = 1; [L5307] struct net_device *proto_group1 ; [L5308] int ldv_state_variable_0 ; [L5309] int ldv_state_variable_3 ; [L5310] int ldv_timer_state_1 = 0; [L5311] int ldv_state_variable_2 ; [L5312] struct sk_buff *proto_group0 ; [L5313] int ref_cnt ; [L5314] int ldv_state_variable_1 ; [L5315] struct timer_list *ldv_timer_list_1 ; [L5374] static struct sk_buff_head tx_queue ; [L5543-L5569] static int cp_table[13U][7U] = { { 163, 16, 16, 16, 16, 16, 16}, { 16, 0, 0, 0, 0, 0, 0}, { 16, 16, 1026, 131, 131, 133, 16}, { 16, 16, 1, 1, 1, 1, 16}, { 2048, 421, 2, 261, 262, 261, 389}, { 2048, 675, 2, 515, 516, 515, 643}, { 2048, 2049, 2, 36, 131, 6, 131}, { 2048, 2049, 2, 163, 131, 165, 131}, { 2048, 2049, 2050, 2051, 2051, 2051, 2114}, { 0, 1, 1, 3, 3, 5, 131}, { 4096, 4097, 4098, 4099, 4100, 4101, 4102}, { 0, 1, 2, 3, 3, 5, 6}, { 0, 1, 1, 1, 1, 1, 1058}}; [L6005-L6007] static struct hdlc_proto proto = {0, & ppp_close, & ppp_start, & ppp_stop, 0, & ppp_ioctl, & ppp_type_trans, & ppp_rx, 0, & __this_module, 0}; [L6008] static struct header_ops const ppp_header_ops = {& ppp_hard_header, 0, 0, 0, 0}; [L6088] int ldv_retval_0 ; [L6508] Element set_impl[15] ; [L6509] int last_index = 0; [L6643] Set LDV_SKBS ; VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6156] struct ifreq *ldvarg0 ; [L6157] void *tmp ; [L6158] unsigned int ldvarg1 ; [L6159] unsigned int tmp___0 ; [L6160] unsigned short ldvarg4 ; [L6161] unsigned short tmp___1 ; [L6162] struct sk_buff *ldvarg3 ; [L6163] void *tmp___2 ; [L6164] struct net_device *ldvarg5 ; [L6165] void *tmp___3 ; [L6166] void *ldvarg2 ; [L6167] void *tmp___4 ; [L6168] void *ldvarg6 ; [L6169] void *tmp___5 ; [L6170] int tmp___6 ; [L6171] int tmp___7 ; [L6172] int tmp___8 ; [L6173] int tmp___9 ; VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6175] CALL, EXPR ldv_zalloc(40UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=40, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=40, tmp___0=1, tx_queue={12:0}] [L6175] RET, EXPR ldv_zalloc(40UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(40UL)={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6175] tmp = ldv_zalloc(40UL) [L6176] ldvarg0 = (struct ifreq *)tmp [L6177] tmp___0 = __VERIFIER_nondet_uint() [L6178] ldvarg1 = tmp___0 [L6179] tmp___1 = __VERIFIER_nondet_ushort() [L6180] ldvarg4 = tmp___1 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg4=10, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tx_queue={12:0}] [L6181] CALL, EXPR ldv_zalloc(232UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=232, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=232, tmp___0=1, tx_queue={12:0}] [L6181] RET, EXPR ldv_zalloc(232UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(232UL)={0:0}, ldvarg0={0:0}, ldvarg1=5, ldvarg4=10, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tx_queue={12:0}] [L6181] tmp___2 = ldv_zalloc(232UL) [L6182] ldvarg3 = (struct sk_buff *)tmp___2 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg3={0:0}, ldvarg4=10, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tx_queue={12:0}] [L6183] CALL, EXPR ldv_zalloc(3264UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=3264, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=3264, tmp___0=1, tx_queue={12:0}] [L6183] RET, EXPR ldv_zalloc(3264UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(3264UL)={0:0}, ldvarg0={0:0}, ldvarg1=5, ldvarg3={0:0}, ldvarg4=10, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tx_queue={12:0}] [L6183] tmp___3 = ldv_zalloc(3264UL) [L6184] ldvarg5 = (struct net_device *)tmp___3 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tx_queue={12:0}] [L6185] CALL, EXPR ldv_zalloc(1UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=1, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=1, tmp___0=1, tx_queue={12:0}] [L6185] RET, EXPR ldv_zalloc(1UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(1UL)={0:0}, ldvarg0={0:0}, ldvarg1=5, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tx_queue={12:0}] [L6185] tmp___4 = ldv_zalloc(1UL) [L6186] ldvarg2 = tmp___4 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tx_queue={12:0}] [L6187] CALL, EXPR ldv_zalloc(1UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=1, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=1, tmp___0=1, tx_queue={12:0}] [L6187] RET, EXPR ldv_zalloc(1UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(1UL)={0:0}, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tx_queue={12:0}] [L6187] tmp___5 = ldv_zalloc(1UL) [L6188] ldvarg6 = tmp___5 [L6189] CALL ldv_initialize() [L6662] CALL ldv_set_init(LDV_SKBS) [L6514] set = set_impl [L6515] last_index = 0 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={16:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6662] RET ldv_set_init(LDV_SKBS) [L6189] RET ldv_initialize() [L6190] ldv_state_variable_1 = 1 [L6191] ref_cnt = 0 [L6192] ldv_state_variable_0 = 1 [L6193] ldv_state_variable_3 = 0 [L6194] ldv_state_variable_2 = 0 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tx_queue={12:0}] [L6196] tmp___6 = __VERIFIER_nondet_int() [L6198] case 0: [L6204] case 1: VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tx_queue={12:0}] [L6205] COND TRUE ldv_state_variable_0 != 0 [L6206] tmp___7 = __VERIFIER_nondet_int() [L6208] case 0: [L6216] case 1: VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tmp___7=1, tx_queue={12:0}] [L6217] COND TRUE ldv_state_variable_0 == 1 [L6218] CALL, EXPR mod_init() [L6076] CALL skb_queue_head_init(& tx_queue) [L5188] struct lock_class_key __key ; VAL [__key={17:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, list={12:0}, list={12:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5190] CALL spinlock_check(& list->lock) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, lock={12:20}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5137] return (& lock->ldv_6338.rlock); VAL [\result={12:20}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, lock={12:20}, lock={12:20}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5190] RET spinlock_check(& list->lock) VAL [__key={17:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, list={12:0}, list={12:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, spinlock_check(& list->lock)={12:20}, tx_queue={12:0}] [L5191] FCALL __raw_spin_lock_init(& list->lock.ldv_6338.rlock, "&(&list->lock)->rlock", & __key) VAL [__key={17:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, list={12:0}, list={12:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5192] CALL __skb_queue_head_init(list) [L5177] struct sk_buff *tmp ; [L5179] tmp = (struct sk_buff *)list [L5180] list->next = tmp [L5181] list->prev = tmp [L5182] list->qlen = 0U VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, list={12:0}, list={12:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={12:0}, tx_queue={12:0}] [L5192] RET __skb_queue_head_init(list) [L5193] return; VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, list={12:0}, list={12:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6076] RET skb_queue_head_init(& tx_queue) [L6077] FCALL register_hdlc_protocol(& proto) [L6078] return (0); VAL [\result=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6218] RET, EXPR mod_init() [L6218] ldv_retval_0 = mod_init() [L6219] COND TRUE ldv_retval_0 == 0 [L6220] ldv_state_variable_0 = 3 [L6221] ldv_state_variable_2 = 1 [L6222] ldv_state_variable_3 = 1 [L6223] CALL ldv_initialize_hdlc_proto_3() [L6115] void *tmp ; [L6116] void *tmp___0 ; VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6118] CALL, EXPR ldv_zalloc(3264UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=3264, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=3264, tmp___0=1, tx_queue={12:0}] [L6118] RET, EXPR ldv_zalloc(3264UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(3264UL)={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6118] tmp = ldv_zalloc(3264UL) [L6119] proto_group1 = (struct net_device *)tmp VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tx_queue={12:0}] [L6120] CALL, EXPR ldv_zalloc(232UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=232, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=232, tmp___0=1, tx_queue={12:0}] [L6120] RET, EXPR ldv_zalloc(232UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(232UL)={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tx_queue={12:0}] [L6120] tmp___0 = ldv_zalloc(232UL) [L6121] proto_group0 = (struct sk_buff *)tmp___0 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0={0:0}, tx_queue={12:0}] [L6223] RET ldv_initialize_hdlc_proto_3() [L6226] COND FALSE !(ldv_retval_0 != 0) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tmp___7=1, tx_queue={12:0}] [L6196] tmp___6 = __VERIFIER_nondet_int() [L6198] case 0: VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=1, tx_queue={12:0}] [L6199] COND TRUE ldv_state_variable_1 != 0 [L6200] CALL choose_timer_1(ldv_timer_list_1) [L6128] LDV_IN_INTERRUPT = 2 [L6129] EXPR timer->data [L6129] EXPR timer->function [L6129] CALL (*(timer->function))(timer->data) [L5913] struct proto *proto___0 ; [L5914] struct ppp *ppp ; [L5915] struct ppp *tmp ; [L5916] unsigned long flags ; [L5917] raw_spinlock_t *tmp___0 ; [L5919] proto___0 = (struct proto *)arg [L5920] EXPR proto___0->dev VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->dev={18446744073709551619:-3264}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5920] CALL, EXPR get_ppp(proto___0->dev) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5378] struct hdlc_device *tmp ; VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, dev={18446744073709551619:-3264}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5380] CALL, EXPR dev_to_hdlc(dev) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5367] void *tmp ; [L5369] CALL, EXPR netdev_priv((struct net_device const *)dev) [L5324] return ((void *)dev + 3264U); VAL [\result={18446744073709551619:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, dev={18446744073709551619:-3264}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5369] RET, EXPR netdev_priv((struct net_device const *)dev) [L5369] tmp = netdev_priv((struct net_device const *)dev) [L5370] return ((struct hdlc_device *)tmp); VAL [\result={18446744073709551619:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, dev={18446744073709551619:-3264}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551619:0}, tx_queue={12:0}] [L5380] RET, EXPR dev_to_hdlc(dev) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, dev={18446744073709551619:-3264}, dev_to_hdlc(dev)={18446744073709551619:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5380] tmp = dev_to_hdlc(dev) [L5381] EXPR tmp->state [L5381] return ((struct ppp *)tmp->state); [L5920] RET, EXPR get_ppp(proto___0->dev) VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, get_ppp(proto___0->dev)={18446744073709551627:-435}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->dev={18446744073709551619:-3264}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5920] tmp = get_ppp(proto___0->dev) [L5921] ppp = tmp VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tx_queue={12:0}] [L5922] CALL, EXPR spinlock_check(& ppp->lock) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, lock={18446744073709551627:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5137] return (& lock->ldv_6338.rlock); VAL [\result={18446744073709551627:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, lock={18446744073709551627:0}, lock={18446744073709551627:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5922] RET, EXPR spinlock_check(& ppp->lock) VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, spinlock_check(& ppp->lock)={18446744073709551627:0}, tmp={18446744073709551627:-435}, tx_queue={12:0}] [L5922] tmp___0 = spinlock_check(& ppp->lock) [L5923] CALL, EXPR _raw_spin_lock_irqsave(tmp___0) VAL [__this_module={18446744073709551625:18446744073709551615}, arg0={18446744073709551627:0}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6731] return __VERIFIER_nondet_ulong(); [L5923] RET, EXPR _raw_spin_lock_irqsave(tmp___0) VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, _raw_spin_lock_irqsave(tmp___0)=18446744073709551614, arg=18446744073709551613, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5923] flags = _raw_spin_lock_irqsave(tmp___0) [L5924] proto___0->state [L5925] case 2: VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5926] case 3: VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5927] case 4: VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5928] case 5: [L5936] case 6: [L5937] EXPR proto___0->pid VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->pid=18, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5937] COND TRUE (unsigned int )proto___0->pid != 49185U [L5955] CALL spin_unlock_irqrestore(& ppp->lock, flags) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5143] FCALL _raw_spin_unlock_irqrestore(& lock->ldv_6338.rlock, flags) [L5955] RET spin_unlock_irqrestore(& ppp->lock, flags) VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5956] CALL ppp_tx_flush() VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5475] struct sk_buff *skb ; VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5481] CALL, EXPR ldv_skb_dequeue_12(& tx_queue) [L6460] struct sk_buff *tmp ; VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6462] CALL, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6646] void *skb ; [L6647] void *tmp___7 ; VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6649] CALL, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND FALSE !(tmp___0 != 0) [L5256] EXPR, FCALL calloc(1UL, size) [L5256] tmp = calloc(1UL, size) [L5257] p = tmp VAL [\old(last_index)=0, \old(size)=248, __this_module={18446744073709551625:18446744073709551615}, calloc(1UL, size)={-18446744073709551615:0}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, p={-18446744073709551615:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=248, tmp={-18446744073709551615:0}, tmp___0=0, tx_queue={12:0}] [L5258] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5227] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cond=1, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5258] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(last_index)=0, \old(size)=248, __this_module={18446744073709551625:18446744073709551615}, calloc(1UL, size)={-18446744073709551615:0}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, p={-18446744073709551615:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=248, tmp={-18446744073709551615:0}, tmp___0=0, tx_queue={12:0}] [L5259] return (p); VAL [\old(last_index)=0, \old(size)=248, \result={-18446744073709551615:0}, __this_module={18446744073709551625:18446744073709551615}, calloc(1UL, size)={-18446744073709551615:0}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, p={-18446744073709551615:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=248, tmp={-18446744073709551615:0}, tmp___0=0, tx_queue={12:0}] [L6649] RET, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(sizeof(struct sk_buff___0 ))={-18446744073709551615:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6649] tmp___7 = ldv_zalloc(sizeof(struct sk_buff___0 )) [L6650] skb = (struct sk_buff___0 *)tmp___7 VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={-18446744073709551615:0}, tmp___7={-18446744073709551615:0}, tx_queue={12:0}] [L6651] COND FALSE !(! skb) [L6654] CALL ldv_set_add(LDV_SKBS, skb) [L6522] int i ; [L6524] i = 0 VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6525] COND TRUE 1 VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6526] COND FALSE !(i < last_index) VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6536] COND TRUE last_index < 15 [L6537] set_impl[last_index] = e [L6538] last_index = last_index + 1 VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6654] RET ldv_set_add(LDV_SKBS, skb) [L6655] return (skb); VAL [\old(last_index)=0, \result={-18446744073709551615:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={-18446744073709551615:0}, tmp___7={-18446744073709551615:0}, tx_queue={12:0}] [L6462] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, ldv_skb_alloc()={-18446744073709551615:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6462] tmp = ldv_skb_alloc() [L6463] return (tmp); VAL [\old(last_index)=0, \result={-18446744073709551615:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={-18446744073709551615:0}, tx_queue={12:0}] [L5481] RET, EXPR ldv_skb_dequeue_12(& tx_queue) [L5481] skb = ldv_skb_dequeue_12(& tx_queue) [L5482] COND TRUE (unsigned long )skb != (unsigned long )((struct sk_buff *)0) VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={-18446744073709551615:0}, tx_queue={12:0}] [L5479] CALL dev_queue_xmit(skb) [L6753] return __VERIFIER_nondet_int(); [L5479] RET dev_queue_xmit(skb) [L5481] CALL, EXPR ldv_skb_dequeue_12(& tx_queue) [L6460] struct sk_buff *tmp ; VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6462] CALL, EXPR ldv_skb_alloc() VAL [\old(last_index)=1, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6646] void *skb ; [L6647] void *tmp___7 ; VAL [\old(last_index)=1, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6649] CALL, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=1, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(last_index)=1, \old(size)=248, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=248, tmp___0=1, tx_queue={12:0}] [L6649] RET, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=1, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(sizeof(struct sk_buff___0 ))={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6649] tmp___7 = ldv_zalloc(sizeof(struct sk_buff___0 )) [L6650] skb = (struct sk_buff___0 *)tmp___7 VAL [\old(last_index)=1, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={0:0}, tmp___7={0:0}, tx_queue={12:0}] [L6651] COND TRUE ! skb [L6652] return ((void *)0); VAL [\old(last_index)=1, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={0:0}, tmp___7={0:0}, tx_queue={12:0}] [L6462] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, ldv_skb_alloc()={0:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6462] tmp = ldv_skb_alloc() [L6463] return (tmp); VAL [\old(last_index)=0, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tx_queue={12:0}] [L5481] RET, EXPR ldv_skb_dequeue_12(& tx_queue) [L5481] skb = ldv_skb_dequeue_12(& tx_queue) [L5482] COND FALSE !((unsigned long )skb != (unsigned long )((struct sk_buff *)0)) VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={0:0}, tx_queue={12:0}] [L5956] RET ppp_tx_flush() VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L6129] RET (*(timer->function))(timer->data) [L6130] LDV_IN_INTERRUPT = 1 [L6131] ldv_timer_state_1 = 2 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, timer={0:0}, timer={0:0}, tx_queue={12:0}] [L6200] RET choose_timer_1(ldv_timer_list_1) [L6196] tmp___6 = __VERIFIER_nondet_int() [L6198] case 0: [L6204] case 1: VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tmp___7=1, tx_queue={12:0}] [L6205] COND TRUE ldv_state_variable_0 != 0 [L6206] tmp___7 = __VERIFIER_nondet_int() [L6208] case 0: VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tmp___7=0, tx_queue={12:0}] [L6209] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L6210] CALL mod_exit() [L6084] FCALL unregister_hdlc_protocol(& proto) [L6210] RET mod_exit() [L6211] ldv_state_variable_0 = 2 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tmp___7=0, tx_queue={12:0}] [L6419] CALL ldv_check_final_state() [L6713] int tmp___7 ; [L6715] CALL, EXPR ldv_set_is_empty(LDV_SKBS) [L6604] return (last_index == 0); VAL [\result=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6715] RET, EXPR ldv_set_is_empty(LDV_SKBS) [L6715] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L6716] COND FALSE !(\read(tmp___7)) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp___7=0, tx_queue={12:0}] [L6718] CALL ldv_error() VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5283] reach_error() VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 34 procedures, 594 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.5s, OverallIterations: 10, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7441 SdHoareTripleChecker+Valid, 21.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7063 mSDsluCounter, 31022 SdHoareTripleChecker+Invalid, 18.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21643 mSDsCounter, 2296 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8081 IncrementalHoareTripleChecker+Invalid, 10377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2296 mSolverCounterUnsat, 9379 mSDtfsCounter, 8081 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 523 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4607occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 2791 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1297 ConstructedInterpolants, 0 QuantifiedInterpolants, 2626 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2516 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 1167/1175 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:50:49,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b4cee1c-6a97-4b83-bc98-581ed067bada/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE