./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a --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 4e0b4bb78430cd3ff87fa852dcd49e649016647ef60f492a14a048040c1b0a8a --- 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-b5237d8 [2022-11-21 16:18:51,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:18:51,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:18:51,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:18:51,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:18:51,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:18:51,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:18:51,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:18:51,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:18:51,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:18:51,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:18:51,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:18:51,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:18:51,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:18:51,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:18:51,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:18:51,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:18:51,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:18:51,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:18:51,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:18:51,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:18:51,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:18:51,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:18:51,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:18:51,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:18:51,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:18:51,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:18:51,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:18:51,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:18:51,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:18:51,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:18:51,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:18:51,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:18:51,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:18:51,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:18:51,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:18:51,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:18:51,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:18:51,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:18:51,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:18:51,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:18:51,570 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 16:18:51,605 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:18:51,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:18:51,607 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:18:51,607 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:18:51,608 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:18:51,608 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:18:51,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:18:51,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:18:51,609 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:18:51,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:18:51,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:18:51,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:18:51,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:18:51,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:18:51,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:18:51,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:18:51,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:18:51,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:18:51,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:18:51,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:18:51,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:18:51,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:18:51,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:18:51,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:18:51,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:18:51,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:18:51,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:18:51,615 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:18:51,615 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:18:51,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:18:51,615 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_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/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_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a 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 -> 4e0b4bb78430cd3ff87fa852dcd49e649016647ef60f492a14a048040c1b0a8a [2022-11-21 16:18:51,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:18:51,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:18:51,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:18:51,909 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:18:51,910 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:18:51,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i [2022-11-21 16:18:55,062 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:18:55,605 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:18:55,606 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i [2022-11-21 16:18:55,643 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/data/0a075cd75/dfce722d9b1846379420f01aa73d3194/FLAG8f783f68f [2022-11-21 16:18:55,665 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/data/0a075cd75/dfce722d9b1846379420f01aa73d3194 [2022-11-21 16:18:55,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:18:55,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:18:55,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:18:55,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:18:55,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:18:55,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:18:55" (1/1) ... [2022-11-21 16:18:55,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472500e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:55, skipping insertion in model container [2022-11-21 16:18:55,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:18:55" (1/1) ... [2022-11-21 16:18:55,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:18:55,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:18:56,464 WARN L237 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_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i[152066,152079] [2022-11-21 16:18:57,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:18:57,058 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:18:57,245 WARN L237 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_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i[152066,152079] [2022-11-21 16:18:57,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:18:57,736 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:18:57,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57 WrapperNode [2022-11-21 16:18:57,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:18:57,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:18:57,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:18:57,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:18:57,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:57,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:57,925 INFO L138 Inliner]: procedures = 141, calls = 780, calls flagged for inlining = 69, calls inlined = 55, statements flattened = 1720 [2022-11-21 16:18:57,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:18:57,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:18:57,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:18:57,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:18:57,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:57,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:57,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:57,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:58,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:58,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:58,042 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:58,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:58,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:18:58,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:18:58,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:18:58,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:18:58,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (1/1) ... [2022-11-21 16:18:58,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:18:58,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:18:58,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:18:58,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:18:58,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-21 16:18:58,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-21 16:18:58,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:18:58,161 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_write_cmdreg [2022-11-21 16:18:58,161 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_write_cmdreg [2022-11-21 16:18:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-11-21 16:18:58,162 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-11-21 16:18:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-21 16:18:58,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-21 16:18:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-21 16:18:58,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-21 16:18:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-21 16:18:58,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-21 16:18:58,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:18:58,164 INFO L130 BoogieDeclarations]: Found specification of procedure set_reset_mode [2022-11-21 16:18:58,164 INFO L138 BoogieDeclarations]: Found implementation of procedure set_reset_mode [2022-11-21 16:18:58,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-21 16:18:58,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-21 16:18:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-21 16:18:58,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-21 16:18:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-21 16:18:58,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-21 16:18:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 16:18:58,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 16:18:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_is_absent [2022-11-21 16:18:58,166 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_is_absent [2022-11-21 16:18:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-21 16:18:58,166 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-21 16:18:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:18:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-21 16:18:58,167 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-21 16:18:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-11-21 16:18:58,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-11-21 16:18:58,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:18:58,168 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-11-21 16:18:58,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-11-21 16:18:58,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:18:58,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:18:58,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-11-21 16:18:58,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-11-21 16:18:58,170 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-21 16:18:58,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-21 16:18:58,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:18:58,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-21 16:18:58,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-21 16:18:58,171 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2022-11-21 16:18:58,171 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2022-11-21 16:18:58,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:18:58,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:18:58,172 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-21 16:18:58,172 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-21 16:18:58,172 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-21 16:18:58,172 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-21 16:18:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2022-11-21 16:18:58,173 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2022-11-21 16:18:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:18:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure sja1000_start [2022-11-21 16:18:58,174 INFO L138 BoogieDeclarations]: Found implementation of procedure sja1000_start [2022-11-21 16:18:58,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-21 16:18:58,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-21 16:18:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:18:58,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:18:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure can_change_mtu [2022-11-21 16:18:58,176 INFO L138 BoogieDeclarations]: Found implementation of procedure can_change_mtu [2022-11-21 16:18:58,707 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:18:58,709 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:18:59,682 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-21 16:19:00,474 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:19:00,496 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:19:00,496 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 16:19:00,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:19:00 BoogieIcfgContainer [2022-11-21 16:19:00,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:19:00,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:19:00,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:19:00,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:19:00,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:18:55" (1/3) ... [2022-11-21 16:19:00,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e122cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:19:00, skipping insertion in model container [2022-11-21 16:19:00,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:18:57" (2/3) ... [2022-11-21 16:19:00,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e122cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:19:00, skipping insertion in model container [2022-11-21 16:19:00,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:19:00" (3/3) ... [2022-11-21 16:19:00,516 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--sja1000--sja1000.ko-entry_point.cil.out.i [2022-11-21 16:19:00,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:19:00,537 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:19:00,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:19:00,637 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;@24f524e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:19:00,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:19:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 505 states, 365 states have (on average 1.3534246575342466) internal successors, (494), 376 states have internal predecessors, (494), 113 states have call successors, (113), 26 states have call predecessors, (113), 25 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2022-11-21 16:19:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:19:00,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:00,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:19:00,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:00,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1467620935, now seen corresponding path program 1 times [2022-11-21 16:19:00,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:00,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086564538] [2022-11-21 16:19:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:00,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:19:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:19:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:01,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086564538] [2022-11-21 16:19:01,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086564538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:19:01,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:19:01,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:19:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884798669] [2022-11-21 16:19:01,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:19:01,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:19:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:19:01,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:19:01,429 INFO L87 Difference]: Start difference. First operand has 505 states, 365 states have (on average 1.3534246575342466) internal successors, (494), 376 states have internal predecessors, (494), 113 states have call successors, (113), 26 states have call predecessors, (113), 25 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:19:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:03,719 INFO L93 Difference]: Finished difference Result 1575 states and 2279 transitions. [2022-11-21 16:19:03,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:19:03,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-21 16:19:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:03,742 INFO L225 Difference]: With dead ends: 1575 [2022-11-21 16:19:03,742 INFO L226 Difference]: Without dead ends: 1057 [2022-11-21 16:19:03,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-21 16:19:03,757 INFO L413 NwaCegarLoop]: 620 mSDtfsCounter, 863 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:03,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1354 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-21 16:19:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2022-11-21 16:19:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 961. [2022-11-21 16:19:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 701 states have (on average 1.326676176890157) internal successors, (930), 709 states have internal predecessors, (930), 212 states have call successors, (212), 48 states have call predecessors, (212), 47 states have return successors, (211), 209 states have call predecessors, (211), 211 states have call successors, (211) [2022-11-21 16:19:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1353 transitions. [2022-11-21 16:19:03,952 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1353 transitions. Word has length 22 [2022-11-21 16:19:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:03,953 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1353 transitions. [2022-11-21 16:19:03,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:19:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1353 transitions. [2022-11-21 16:19:03,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 16:19:03,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:03,956 INFO L195 NwaCegarLoop]: trace histogram [1, 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-21 16:19:03,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:19:03,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash -486092477, now seen corresponding path program 1 times [2022-11-21 16:19:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:03,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687744470] [2022-11-21 16:19:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:04,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:19:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:19:04,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:04,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687744470] [2022-11-21 16:19:04,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687744470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:19:04,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:19:04,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:19:04,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749531074] [2022-11-21 16:19:04,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:19:04,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:19:04,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:04,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:19:04,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:19:04,204 INFO L87 Difference]: Start difference. First operand 961 states and 1353 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:19:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:05,860 INFO L93 Difference]: Finished difference Result 2011 states and 2840 transitions. [2022-11-21 16:19:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:19:05,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-21 16:19:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:05,873 INFO L225 Difference]: With dead ends: 2011 [2022-11-21 16:19:05,873 INFO L226 Difference]: Without dead ends: 1056 [2022-11-21 16:19:05,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-21 16:19:05,883 INFO L413 NwaCegarLoop]: 722 mSDtfsCounter, 935 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:05,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 1620 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-21 16:19:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-11-21 16:19:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 960. [2022-11-21 16:19:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 700 states have (on average 1.322857142857143) internal successors, (926), 708 states have internal predecessors, (926), 212 states have call successors, (212), 48 states have call predecessors, (212), 47 states have return successors, (211), 209 states have call predecessors, (211), 211 states have call successors, (211) [2022-11-21 16:19:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1349 transitions. [2022-11-21 16:19:05,999 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1349 transitions. Word has length 25 [2022-11-21 16:19:06,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:06,000 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1349 transitions. [2022-11-21 16:19:06,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 16:19:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1349 transitions. [2022-11-21 16:19:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 16:19:06,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:06,009 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:19:06,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:19:06,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:06,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1949169694, now seen corresponding path program 1 times [2022-11-21 16:19:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:06,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879539650] [2022-11-21 16:19:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:06,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:06,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:19:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 16:19:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:19:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:06,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879539650] [2022-11-21 16:19:06,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879539650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:19:06,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:19:06,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:19:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862969442] [2022-11-21 16:19:06,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:19:06,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:19:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:06,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:19:06,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:19:06,441 INFO L87 Difference]: Start difference. First operand 960 states and 1349 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:19:08,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:08,805 INFO L93 Difference]: Finished difference Result 2092 states and 2986 transitions. [2022-11-21 16:19:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:19:08,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-21 16:19:08,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:08,818 INFO L225 Difference]: With dead ends: 2092 [2022-11-21 16:19:08,819 INFO L226 Difference]: Without dead ends: 2085 [2022-11-21 16:19:08,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:19:08,821 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 843 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:08,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 2365 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-21 16:19:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2022-11-21 16:19:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1903. [2022-11-21 16:19:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1384 states have (on average 1.324421965317919) internal successors, (1833), 1402 states have internal predecessors, (1833), 422 states have call successors, (422), 95 states have call predecessors, (422), 96 states have return successors, (447), 417 states have call predecessors, (447), 421 states have call successors, (447) [2022-11-21 16:19:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2702 transitions. [2022-11-21 16:19:08,962 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2702 transitions. Word has length 39 [2022-11-21 16:19:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:08,965 INFO L495 AbstractCegarLoop]: Abstraction has 1903 states and 2702 transitions. [2022-11-21 16:19:08,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 16:19:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2702 transitions. [2022-11-21 16:19:08,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-21 16:19:08,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:08,975 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-21 16:19:08,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:19:08,976 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:08,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:08,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1997828829, now seen corresponding path program 1 times [2022-11-21 16:19:08,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:08,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061476535] [2022-11-21 16:19:08,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:09,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:19:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:09,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 16:19:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:09,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 16:19:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 16:19:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:09,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:19:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:19:09,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:09,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061476535] [2022-11-21 16:19:09,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061476535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:19:09,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:19:09,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:19:09,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409670243] [2022-11-21 16:19:09,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:19:09,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:19:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:09,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:19:09,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:19:09,277 INFO L87 Difference]: Start difference. First operand 1903 states and 2702 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-21 16:19:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:12,375 INFO L93 Difference]: Finished difference Result 5932 states and 8540 transitions. [2022-11-21 16:19:12,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:19:12,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 75 [2022-11-21 16:19:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:12,404 INFO L225 Difference]: With dead ends: 5932 [2022-11-21 16:19:12,405 INFO L226 Difference]: Without dead ends: 4035 [2022-11-21 16:19:12,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:19:12,421 INFO L413 NwaCegarLoop]: 610 mSDtfsCounter, 967 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:12,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1618 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-21 16:19:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4035 states. [2022-11-21 16:19:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4035 to 3356. [2022-11-21 16:19:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3356 states, 2475 states have (on average 1.3204040404040405) internal successors, (3268), 2507 states have internal predecessors, (3268), 691 states have call successors, (691), 168 states have call predecessors, (691), 189 states have return successors, (776), 700 states have call predecessors, (776), 690 states have call successors, (776) [2022-11-21 16:19:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 4735 transitions. [2022-11-21 16:19:12,780 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 4735 transitions. Word has length 75 [2022-11-21 16:19:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:12,780 INFO L495 AbstractCegarLoop]: Abstraction has 3356 states and 4735 transitions. [2022-11-21 16:19:12,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-21 16:19:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 4735 transitions. [2022-11-21 16:19:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-21 16:19:12,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:12,787 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-21 16:19:12,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:19:12,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:12,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash 518489023, now seen corresponding path program 2 times [2022-11-21 16:19:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:12,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535489549] [2022-11-21 16:19:12,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:12,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:19:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:12,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:19:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 16:19:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:13,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:19:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:13,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 16:19:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:19:13,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:13,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535489549] [2022-11-21 16:19:13,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535489549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:19:13,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:19:13,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:19:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521841011] [2022-11-21 16:19:13,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:19:13,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:19:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:13,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:19:13,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:19:13,023 INFO L87 Difference]: Start difference. First operand 3356 states and 4735 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 16:19:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:16,281 INFO L93 Difference]: Finished difference Result 6928 states and 9862 transitions. [2022-11-21 16:19:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:19:16,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2022-11-21 16:19:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:16,307 INFO L225 Difference]: With dead ends: 6928 [2022-11-21 16:19:16,307 INFO L226 Difference]: Without dead ends: 3585 [2022-11-21 16:19:16,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:19:16,324 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 996 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:16,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 1548 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-21 16:19:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2022-11-21 16:19:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 2960. [2022-11-21 16:19:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2960 states, 2186 states have (on average 1.3156450137236964) internal successors, (2876), 2214 states have internal predecessors, (2876), 595 states have call successors, (595), 158 states have call predecessors, (595), 178 states have return successors, (673), 605 states have call predecessors, (673), 594 states have call successors, (673) [2022-11-21 16:19:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 4144 transitions. [2022-11-21 16:19:16,546 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 4144 transitions. Word has length 75 [2022-11-21 16:19:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:16,547 INFO L495 AbstractCegarLoop]: Abstraction has 2960 states and 4144 transitions. [2022-11-21 16:19:16,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 16:19:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 4144 transitions. [2022-11-21 16:19:16,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-21 16:19:16,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:16,555 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-21 16:19:16,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:19:16,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:16,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1409035122, now seen corresponding path program 1 times [2022-11-21 16:19:16,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:16,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24673366] [2022-11-21 16:19:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:19:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:16,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 16:19:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:19:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-21 16:19:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:16,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:19:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 16:19:16,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24673366] [2022-11-21 16:19:16,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24673366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:19:16,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:19:16,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:19:16,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201830196] [2022-11-21 16:19:16,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:19:16,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:19:16,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:19:16,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:19:16,806 INFO L87 Difference]: Start difference. First operand 2960 states and 4144 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 16:19:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:20,425 INFO L93 Difference]: Finished difference Result 6713 states and 9562 transitions. [2022-11-21 16:19:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:19:20,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2022-11-21 16:19:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:20,463 INFO L225 Difference]: With dead ends: 6713 [2022-11-21 16:19:20,463 INFO L226 Difference]: Without dead ends: 4395 [2022-11-21 16:19:20,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:19:20,481 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 895 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:20,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1981 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-21 16:19:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2022-11-21 16:19:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 3631. [2022-11-21 16:19:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3631 states, 2689 states have (on average 1.3153588694682037) internal successors, (3537), 2723 states have internal predecessors, (3537), 718 states have call successors, (718), 198 states have call predecessors, (718), 223 states have return successors, (814), 731 states have call predecessors, (814), 717 states have call successors, (814) [2022-11-21 16:19:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3631 states to 3631 states and 5069 transitions. [2022-11-21 16:19:20,769 INFO L78 Accepts]: Start accepts. Automaton has 3631 states and 5069 transitions. Word has length 88 [2022-11-21 16:19:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:20,770 INFO L495 AbstractCegarLoop]: Abstraction has 3631 states and 5069 transitions. [2022-11-21 16:19:20,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 16:19:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3631 states and 5069 transitions. [2022-11-21 16:19:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-21 16:19:20,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:20,786 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 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-21 16:19:20,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:19:20,786 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:20,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:20,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1723989137, now seen corresponding path program 1 times [2022-11-21 16:19:20,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:20,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853417208] [2022-11-21 16:19:20,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:19:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 16:19:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:19:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-21 16:19:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:19:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:19:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:19:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:19:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:19:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:19:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-21 16:19:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:21,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853417208] [2022-11-21 16:19:21,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853417208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:19:21,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:19:21,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:19:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6092589] [2022-11-21 16:19:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:19:21,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:19:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:21,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:19:21,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:19:21,151 INFO L87 Difference]: Start difference. First operand 3631 states and 5069 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 16:19:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:23,541 INFO L93 Difference]: Finished difference Result 8102 states and 11615 transitions. [2022-11-21 16:19:23,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:19:23,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2022-11-21 16:19:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:23,568 INFO L225 Difference]: With dead ends: 8102 [2022-11-21 16:19:23,568 INFO L226 Difference]: Without dead ends: 4484 [2022-11-21 16:19:23,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:19:23,594 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 586 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:23,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1510 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-21 16:19:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2022-11-21 16:19:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 3641. [2022-11-21 16:19:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3641 states, 2699 states have (on average 1.3141904409040386) internal successors, (3547), 2733 states have internal predecessors, (3547), 718 states have call successors, (718), 198 states have call predecessors, (718), 223 states have return successors, (814), 731 states have call predecessors, (814), 717 states have call successors, (814) [2022-11-21 16:19:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5079 transitions. [2022-11-21 16:19:23,885 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5079 transitions. Word has length 127 [2022-11-21 16:19:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:23,886 INFO L495 AbstractCegarLoop]: Abstraction has 3641 states and 5079 transitions. [2022-11-21 16:19:23,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 16:19:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5079 transitions. [2022-11-21 16:19:23,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-21 16:19:23,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:23,901 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-21 16:19:23,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:19:23,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:23,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:23,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2576453, now seen corresponding path program 1 times [2022-11-21 16:19:23,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:23,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238627732] [2022-11-21 16:19:23,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:23,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:19:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 16:19:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:19:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:19:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:19:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:19:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:19:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 16:19:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 16:19:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:19:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:19:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 16:19:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:24,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238627732] [2022-11-21 16:19:24,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238627732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:19:24,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:19:24,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:19:24,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307499090] [2022-11-21 16:19:24,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:19:24,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:19:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:24,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:19:24,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:19:24,429 INFO L87 Difference]: Start difference. First operand 3641 states and 5079 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:19:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:29,047 INFO L93 Difference]: Finished difference Result 11364 states and 16299 transitions. [2022-11-21 16:19:29,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:19:29,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 129 [2022-11-21 16:19:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:29,134 INFO L225 Difference]: With dead ends: 11364 [2022-11-21 16:19:29,134 INFO L226 Difference]: Without dead ends: 8017 [2022-11-21 16:19:29,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:19:29,157 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 1586 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 3196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:29,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1730 Valid, 2350 Invalid, 3196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-21 16:19:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8017 states. [2022-11-21 16:19:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8017 to 6645. [2022-11-21 16:19:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6645 states, 4930 states have (on average 1.3135902636916836) internal successors, (6476), 4992 states have internal predecessors, (6476), 1310 states have call successors, (1310), 358 states have call predecessors, (1310), 404 states have return successors, (1485), 1334 states have call predecessors, (1485), 1309 states have call successors, (1485) [2022-11-21 16:19:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6645 states to 6645 states and 9271 transitions. [2022-11-21 16:19:29,643 INFO L78 Accepts]: Start accepts. Automaton has 6645 states and 9271 transitions. Word has length 129 [2022-11-21 16:19:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:29,644 INFO L495 AbstractCegarLoop]: Abstraction has 6645 states and 9271 transitions. [2022-11-21 16:19:29,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:19:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6645 states and 9271 transitions. [2022-11-21 16:19:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-21 16:19:29,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:29,698 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-21 16:19:29,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:19:29,698 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:29,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1344595964, now seen corresponding path program 1 times [2022-11-21 16:19:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:29,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202137439] [2022-11-21 16:19:29,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:29,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:19:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 16:19:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:19:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:30,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 16:19:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:19:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:30,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 16:19:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 16:19:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:30,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-21 16:19:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:30,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 16:19:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:19:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:30,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:19:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 16:19:30,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:30,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202137439] [2022-11-21 16:19:30,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202137439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:19:30,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:19:30,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:19:30,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372776232] [2022-11-21 16:19:30,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:19:30,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:19:30,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:30,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:19:30,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:19:30,239 INFO L87 Difference]: Start difference. First operand 6645 states and 9271 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:19:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:37,033 INFO L93 Difference]: Finished difference Result 19941 states and 29435 transitions. [2022-11-21 16:19:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 16:19:37,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 131 [2022-11-21 16:19:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:37,181 INFO L225 Difference]: With dead ends: 19941 [2022-11-21 16:19:37,181 INFO L226 Difference]: Without dead ends: 13309 [2022-11-21 16:19:37,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-21 16:19:37,207 INFO L413 NwaCegarLoop]: 914 mSDtfsCounter, 2435 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 1627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2619 SdHoareTripleChecker+Valid, 3659 SdHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1627 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:37,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2619 Valid, 3659 Invalid, 4832 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1627 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-21 16:19:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13309 states. [2022-11-21 16:19:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13309 to 6681. [2022-11-21 16:19:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6681 states, 4966 states have (on average 1.3113169552960129) internal successors, (6512), 5028 states have internal predecessors, (6512), 1310 states have call successors, (1310), 358 states have call predecessors, (1310), 404 states have return successors, (1485), 1334 states have call predecessors, (1485), 1309 states have call successors, (1485) [2022-11-21 16:19:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 9307 transitions. [2022-11-21 16:19:37,911 INFO L78 Accepts]: Start accepts. Automaton has 6681 states and 9307 transitions. Word has length 131 [2022-11-21 16:19:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:37,911 INFO L495 AbstractCegarLoop]: Abstraction has 6681 states and 9307 transitions. [2022-11-21 16:19:37,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 16:19:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 6681 states and 9307 transitions. [2022-11-21 16:19:37,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-21 16:19:37,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:19:37,926 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-21 16:19:37,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:19:37,926 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:19:37,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1067106364, now seen corresponding path program 1 times [2022-11-21 16:19:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:37,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964975041] [2022-11-21 16:19:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:19:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 16:19:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:19:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-21 16:19:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:19:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:19:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 16:19:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-21 16:19:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 16:19:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:19:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-21 16:19:38,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:38,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964975041] [2022-11-21 16:19:38,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964975041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:19:38,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:19:38,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:19:38,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259548090] [2022-11-21 16:19:38,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:19:38,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:19:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:38,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:19:38,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:19:38,620 INFO L87 Difference]: Start difference. First operand 6681 states and 9307 transitions. Second operand has 10 states, 9 states have (on average 9.444444444444445) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:19:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:19:42,198 INFO L93 Difference]: Finished difference Result 10583 states and 14977 transitions. [2022-11-21 16:19:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:19:42,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.444444444444445) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 130 [2022-11-21 16:19:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:19:42,201 INFO L225 Difference]: With dead ends: 10583 [2022-11-21 16:19:42,202 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 16:19:42,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:19:42,240 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 1204 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:19:42,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 1883 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-21 16:19:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 16:19:42,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 16:19:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:19:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 16:19:42,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2022-11-21 16:19:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:19:42,244 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:19:42,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.444444444444445) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:19:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:19:42,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 16:19:42,247 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 16:19:42,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:19:42,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 16:21:07,643 INFO L895 garLoopResultBuilder]: At program point ldv_skb_free_intENTRY(lines 6870 6876) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-21 16:21:07,643 INFO L899 garLoopResultBuilder]: For program point ldv_skb_free_intFINAL(lines 6870 6876) no Hoare annotation was computed. [2022-11-21 16:21:07,643 INFO L899 garLoopResultBuilder]: For program point ldv_skb_free_intEXIT(lines 6870 6876) no Hoare annotation was computed. [2022-11-21 16:21:07,643 INFO L899 garLoopResultBuilder]: For program point L6873-1(line 6873) no Hoare annotation was computed. [2022-11-21 16:21:07,643 INFO L895 garLoopResultBuilder]: At program point L6873(line 6873) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-21 16:21:07,643 INFO L899 garLoopResultBuilder]: For program point __const_udelayFINAL(lines 6920 6922) no Hoare annotation was computed. [2022-11-21 16:21:07,644 INFO L899 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 6920 6922) no Hoare annotation was computed. [2022-11-21 16:21:07,644 INFO L902 garLoopResultBuilder]: At program point __const_udelayENTRY(lines 6920 6922) the Hoare annotation is: true [2022-11-21 16:21:07,644 INFO L895 garLoopResultBuilder]: At program point L5598(line 5598) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,644 INFO L895 garLoopResultBuilder]: At program point L5600(lines 5582 5607) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,644 INFO L899 garLoopResultBuilder]: For program point L5596-1(line 5596) no Hoare annotation was computed. [2022-11-21 16:21:07,645 INFO L899 garLoopResultBuilder]: For program point set_reset_modeFINAL(lines 5575 5608) no Hoare annotation was computed. [2022-11-21 16:21:07,645 INFO L895 garLoopResultBuilder]: At program point L5597(line 5597) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,645 INFO L899 garLoopResultBuilder]: For program point L5598-1(line 5598) no Hoare annotation was computed. [2022-11-21 16:21:07,645 INFO L895 garLoopResultBuilder]: At program point L5596(line 5596) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,645 INFO L899 garLoopResultBuilder]: For program point L5597-1(line 5597) no Hoare annotation was computed. [2022-11-21 16:21:07,646 INFO L899 garLoopResultBuilder]: For program point set_reset_modeEXIT(lines 5575 5608) no Hoare annotation was computed. [2022-11-21 16:21:07,646 INFO L895 garLoopResultBuilder]: At program point L5587(line 5587) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,646 INFO L899 garLoopResultBuilder]: For program point L5587-1(line 5587) no Hoare annotation was computed. [2022-11-21 16:21:07,646 INFO L895 garLoopResultBuilder]: At program point L5583(line 5583) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,646 INFO L899 garLoopResultBuilder]: For program point L5583-1(line 5583) no Hoare annotation was computed. [2022-11-21 16:21:07,646 INFO L895 garLoopResultBuilder]: At program point L5585(line 5585) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,647 INFO L899 garLoopResultBuilder]: For program point L5585-1(line 5585) no Hoare annotation was computed. [2022-11-21 16:21:07,647 INFO L895 garLoopResultBuilder]: At program point set_reset_modeENTRY(lines 5575 5608) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,647 INFO L895 garLoopResultBuilder]: At program point L5602(lines 5582 5607) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,647 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 5293 5299) no Hoare annotation was computed. [2022-11-21 16:21:07,647 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 5293 5299) the Hoare annotation is: true [2022-11-21 16:21:07,648 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5297) no Hoare annotation was computed. [2022-11-21 16:21:07,648 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 5293 5299) no Hoare annotation was computed. [2022-11-21 16:21:07,648 INFO L899 garLoopResultBuilder]: For program point L6014(lines 6014 6017) no Hoare annotation was computed. [2022-11-21 16:21:07,648 INFO L895 garLoopResultBuilder]: At program point L6113(line 6113) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,648 INFO L899 garLoopResultBuilder]: For program point L6113-1(line 6113) no Hoare annotation was computed. [2022-11-21 16:21:07,648 INFO L899 garLoopResultBuilder]: For program point L6146-2(lines 6065 6166) no Hoare annotation was computed. [2022-11-21 16:21:07,649 INFO L895 garLoopResultBuilder]: At program point L5882(lines 5813 5884) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,649 INFO L899 garLoopResultBuilder]: For program point L6014-2(lines 6014 6017) no Hoare annotation was computed. [2022-11-21 16:21:07,649 INFO L895 garLoopResultBuilder]: At program point ldv_irq_1ENTRY(lines 6349 6374) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~LDV_IN_INTERRUPT~0)| ~LDV_IN_INTERRUPT~0) (= |old(~last_index~0)| ~last_index~0))) [2022-11-21 16:21:07,649 INFO L899 garLoopResultBuilder]: For program point L6031(lines 6031 6037) no Hoare annotation was computed. [2022-11-21 16:21:07,649 INFO L899 garLoopResultBuilder]: For program point L5965(lines 5965 5979) no Hoare annotation was computed. [2022-11-21 16:21:07,650 INFO L899 garLoopResultBuilder]: For program point L6031-2(lines 6031 6037) no Hoare annotation was computed. [2022-11-21 16:21:07,650 INFO L895 garLoopResultBuilder]: At program point L6147(line 6147) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,650 INFO L899 garLoopResultBuilder]: For program point L6114(lines 6114 6121) no Hoare annotation was computed. [2022-11-21 16:21:07,650 INFO L899 garLoopResultBuilder]: For program point L6147-1(line 6147) no Hoare annotation was computed. [2022-11-21 16:21:07,650 INFO L899 garLoopResultBuilder]: For program point L6131(lines 6131 6134) no Hoare annotation was computed. [2022-11-21 16:21:07,650 INFO L899 garLoopResultBuilder]: For program point L5966(line 5966) no Hoare annotation was computed. [2022-11-21 16:21:07,651 INFO L895 garLoopResultBuilder]: At program point L5834(line 5834) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,651 INFO L895 garLoopResultBuilder]: At program point L5933(line 5933) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,651 INFO L895 garLoopResultBuilder]: At program point L6957(lines 6956 6958) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,651 INFO L899 garLoopResultBuilder]: For program point L5834-1(line 5834) no Hoare annotation was computed. [2022-11-21 16:21:07,651 INFO L895 garLoopResultBuilder]: At program point L6115(line 6115) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,652 INFO L895 garLoopResultBuilder]: At program point L6082(line 6082) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,652 INFO L899 garLoopResultBuilder]: For program point L6115-1(line 6115) no Hoare annotation was computed. [2022-11-21 16:21:07,652 INFO L899 garLoopResultBuilder]: For program point L6082-1(line 6082) no Hoare annotation was computed. [2022-11-21 16:21:07,652 INFO L895 garLoopResultBuilder]: At program point L6941-2(lines 6940 6942) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,652 INFO L899 garLoopResultBuilder]: For program point L6941-1(line 6941) no Hoare annotation was computed. [2022-11-21 16:21:07,652 INFO L899 garLoopResultBuilder]: For program point L5917(lines 5917 5935) no Hoare annotation was computed. [2022-11-21 16:21:07,653 INFO L895 garLoopResultBuilder]: At program point L6941(line 6941) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,653 INFO L899 garLoopResultBuilder]: For program point L5917-1(lines 5907 6047) no Hoare annotation was computed. [2022-11-21 16:21:07,653 INFO L895 garLoopResultBuilder]: At program point L6165(lines 6049 6167) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,653 INFO L899 garLoopResultBuilder]: For program point L5868-1(line 5868) no Hoare annotation was computed. [2022-11-21 16:21:07,653 INFO L895 garLoopResultBuilder]: At program point L5868(line 5868) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,653 INFO L899 garLoopResultBuilder]: For program point L6083(lines 6083 6090) no Hoare annotation was computed. [2022-11-21 16:21:07,654 INFO L899 garLoopResultBuilder]: For program point L6116(lines 6116 6119) no Hoare annotation was computed. [2022-11-21 16:21:07,654 INFO L899 garLoopResultBuilder]: For program point L6083-2(lines 6065 6166) no Hoare annotation was computed. [2022-11-21 16:21:07,654 INFO L895 garLoopResultBuilder]: At program point L6067(line 6067) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-21 16:21:07,654 INFO L899 garLoopResultBuilder]: For program point L6100-1(line 6100) no Hoare annotation was computed. [2022-11-21 16:21:07,654 INFO L899 garLoopResultBuilder]: For program point L6067-1(line 6067) no Hoare annotation was computed. [2022-11-21 16:21:07,654 INFO L895 garLoopResultBuilder]: At program point L6100(line 6100) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,655 INFO L899 garLoopResultBuilder]: For program point L6150(lines 6150 6164) no Hoare annotation was computed. [2022-11-21 16:21:07,655 INFO L899 garLoopResultBuilder]: For program point L6084-1(line 6084) no Hoare annotation was computed. [2022-11-21 16:21:07,655 INFO L895 garLoopResultBuilder]: At program point L6018(line 6018) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,655 INFO L895 garLoopResultBuilder]: At program point L6084(line 6084) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,655 INFO L899 garLoopResultBuilder]: For program point L6018-1(line 6018) no Hoare annotation was computed. [2022-11-21 16:21:07,655 INFO L895 garLoopResultBuilder]: At program point L5853(line 5853) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,656 INFO L899 garLoopResultBuilder]: For program point L5853-1(line 5853) no Hoare annotation was computed. [2022-11-21 16:21:07,656 INFO L895 garLoopResultBuilder]: At program point L5870(lines 5862 5875) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,656 INFO L899 garLoopResultBuilder]: For program point L5969(line 5969) no Hoare annotation was computed. [2022-11-21 16:21:07,656 INFO L899 garLoopResultBuilder]: For program point L5936(lines 5907 6047) no Hoare annotation was computed. [2022-11-21 16:21:07,656 INFO L899 garLoopResultBuilder]: For program point L6085(lines 6085 6088) no Hoare annotation was computed. [2022-11-21 16:21:07,656 INFO L895 garLoopResultBuilder]: At program point L6944-2(lines 6943 6945) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,657 INFO L899 garLoopResultBuilder]: For program point L6366(line 6366) no Hoare annotation was computed. [2022-11-21 16:21:07,657 INFO L899 garLoopResultBuilder]: For program point L6944-1(line 6944) no Hoare annotation was computed. [2022-11-21 16:21:07,657 INFO L895 garLoopResultBuilder]: At program point L5854(line 5854) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,657 INFO L895 garLoopResultBuilder]: At program point L6944(line 6944) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,657 INFO L899 garLoopResultBuilder]: For program point L5953(lines 5953 5957) no Hoare annotation was computed. [2022-11-21 16:21:07,657 INFO L899 garLoopResultBuilder]: For program point L5854-1(line 5854) no Hoare annotation was computed. [2022-11-21 16:21:07,658 INFO L899 garLoopResultBuilder]: For program point L5871(lines 5871 5874) no Hoare annotation was computed. [2022-11-21 16:21:07,658 INFO L899 garLoopResultBuilder]: For program point L5838(lines 5838 5841) no Hoare annotation was computed. [2022-11-21 16:21:07,658 INFO L895 garLoopResultBuilder]: At program point L6961(lines 6960 6962) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,658 INFO L899 garLoopResultBuilder]: For program point L5987(lines 5907 6047) no Hoare annotation was computed. [2022-11-21 16:21:07,658 INFO L895 garLoopResultBuilder]: At program point L6367(line 6367) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) [2022-11-21 16:21:07,659 INFO L895 garLoopResultBuilder]: At program point L5872(lines 5862 5875) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,659 INFO L899 garLoopResultBuilder]: For program point L6665-1(line 6665) no Hoare annotation was computed. [2022-11-21 16:21:07,659 INFO L895 garLoopResultBuilder]: At program point L6665(line 6665) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,659 INFO L899 garLoopResultBuilder]: For program point L6071(lines 6071 6074) no Hoare annotation was computed. [2022-11-21 16:21:07,659 INFO L899 garLoopResultBuilder]: For program point L6071-2(lines 6071 6074) no Hoare annotation was computed. [2022-11-21 16:21:07,659 INFO L899 garLoopResultBuilder]: For program point L5972(line 5972) no Hoare annotation was computed. [2022-11-21 16:21:07,660 INFO L895 garLoopResultBuilder]: At program point L6666(lines 6661 6668) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,660 INFO L895 garLoopResultBuilder]: At program point L6138(lines 6065 6166) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,660 INFO L899 garLoopResultBuilder]: For program point L6072-1(line 6072) no Hoare annotation was computed. [2022-11-21 16:21:07,660 INFO L899 garLoopResultBuilder]: For program point ldv_irq_1FINAL(lines 6349 6374) no Hoare annotation was computed. [2022-11-21 16:21:07,660 INFO L895 garLoopResultBuilder]: At program point L6105(line 6105) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,661 INFO L895 garLoopResultBuilder]: At program point L6072(line 6072) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-21 16:21:07,661 INFO L899 garLoopResultBuilder]: For program point L6006-1(lines 6006 6024) no Hoare annotation was computed. [2022-11-21 16:21:07,661 INFO L895 garLoopResultBuilder]: At program point L6122(lines 6109 6127) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,661 INFO L899 garLoopResultBuilder]: For program point L5924-1(line 5924) no Hoare annotation was computed. [2022-11-21 16:21:07,661 INFO L895 garLoopResultBuilder]: At program point L5924(line 5924) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,661 INFO L895 garLoopResultBuilder]: At program point L6139(line 6139) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,662 INFO L899 garLoopResultBuilder]: For program point L6139-1(line 6139) no Hoare annotation was computed. [2022-11-21 16:21:07,662 INFO L899 garLoopResultBuilder]: For program point L6354(lines 6354 6371) no Hoare annotation was computed. [2022-11-21 16:21:07,662 INFO L899 garLoopResultBuilder]: For program point L5908-1(line 5908) no Hoare annotation was computed. [2022-11-21 16:21:07,662 INFO L895 garLoopResultBuilder]: At program point L5842(line 5842) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,662 INFO L895 garLoopResultBuilder]: At program point L5908(line 5908) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,662 INFO L899 garLoopResultBuilder]: For program point L5842-1(line 5842) no Hoare annotation was computed. [2022-11-21 16:21:07,663 INFO L895 garLoopResultBuilder]: At program point L6354-1(lines 6354 6371) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~LDV_IN_INTERRUPT~0)| ~LDV_IN_INTERRUPT~0) (= |old(~last_index~0)| ~last_index~0))) [2022-11-21 16:21:07,663 INFO L899 garLoopResultBuilder]: For program point L5925-2(lines 5925 5928) no Hoare annotation was computed. [2022-11-21 16:21:07,663 INFO L899 garLoopResultBuilder]: For program point L5925(lines 5925 5928) no Hoare annotation was computed. [2022-11-21 16:21:07,663 INFO L899 garLoopResultBuilder]: For program point L6140(lines 6140 6143) no Hoare annotation was computed. [2022-11-21 16:21:07,663 INFO L899 garLoopResultBuilder]: For program point L5975(line 5975) no Hoare annotation was computed. [2022-11-21 16:21:07,663 INFO L899 garLoopResultBuilder]: For program point L5843(lines 5843 5856) no Hoare annotation was computed. [2022-11-21 16:21:07,664 INFO L899 garLoopResultBuilder]: For program point L5843-2(lines 5843 5856) no Hoare annotation was computed. [2022-11-21 16:21:07,664 INFO L899 garLoopResultBuilder]: For program point L6091-1(lines 6065 6166) no Hoare annotation was computed. [2022-11-21 16:21:07,664 INFO L895 garLoopResultBuilder]: At program point L6157(line 6157) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,664 INFO L895 garLoopResultBuilder]: At program point L6124(lines 6109 6127) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,664 INFO L899 garLoopResultBuilder]: For program point L6157-1(line 6157) no Hoare annotation was computed. [2022-11-21 16:21:07,664 INFO L895 garLoopResultBuilder]: At program point L6950(lines 6949 6951) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,665 INFO L899 garLoopResultBuilder]: For program point L6025-2(lines 6025 6041) no Hoare annotation was computed. [2022-11-21 16:21:07,665 INFO L899 garLoopResultBuilder]: For program point L6025(lines 6025 6041) no Hoare annotation was computed. [2022-11-21 16:21:07,665 INFO L899 garLoopResultBuilder]: For program point L5860-2(lines 5860 5875) no Hoare annotation was computed. [2022-11-21 16:21:07,665 INFO L899 garLoopResultBuilder]: For program point L5860(lines 5860 5875) no Hoare annotation was computed. [2022-11-21 16:21:07,665 INFO L895 garLoopResultBuilder]: At program point L6075(line 6075) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,666 INFO L899 garLoopResultBuilder]: For program point L6075-1(line 6075) no Hoare annotation was computed. [2022-11-21 16:21:07,666 INFO L895 garLoopResultBuilder]: At program point L6141(lines 6065 6166) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,666 INFO L895 garLoopResultBuilder]: At program point L5943(line 5943) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,666 INFO L899 garLoopResultBuilder]: For program point L5943-1(line 5943) no Hoare annotation was computed. [2022-11-21 16:21:07,666 INFO L895 garLoopResultBuilder]: At program point L5877(line 5877) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,666 INFO L899 garLoopResultBuilder]: For program point L6356(lines 6356 6368) no Hoare annotation was computed. [2022-11-21 16:21:07,667 INFO L899 garLoopResultBuilder]: For program point L5877-1(line 5877) no Hoare annotation was computed. [2022-11-21 16:21:07,667 INFO L899 garLoopResultBuilder]: For program point L6158(lines 6158 6162) no Hoare annotation was computed. [2022-11-21 16:21:07,667 INFO L895 garLoopResultBuilder]: At program point L6026(line 6026) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,667 INFO L899 garLoopResultBuilder]: For program point L6026-1(line 6026) no Hoare annotation was computed. [2022-11-21 16:21:07,667 INFO L899 garLoopResultBuilder]: For program point L5960(lines 5907 6047) no Hoare annotation was computed. [2022-11-21 16:21:07,667 INFO L899 garLoopResultBuilder]: For program point L6076(lines 6076 6079) no Hoare annotation was computed. [2022-11-21 16:21:07,668 INFO L899 garLoopResultBuilder]: For program point L6109-1(lines 6065 6166) no Hoare annotation was computed. [2022-11-21 16:21:07,668 INFO L899 garLoopResultBuilder]: For program point L5944-2(lines 5936 5958) no Hoare annotation was computed. [2022-11-21 16:21:07,668 INFO L899 garLoopResultBuilder]: For program point L5944(lines 5944 5947) no Hoare annotation was computed. [2022-11-21 16:21:07,668 INFO L895 garLoopResultBuilder]: At program point L5845(line 5845) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,668 INFO L899 garLoopResultBuilder]: For program point L6357(line 6357) no Hoare annotation was computed. [2022-11-21 16:21:07,668 INFO L899 garLoopResultBuilder]: For program point L5845-1(line 5845) no Hoare annotation was computed. [2022-11-21 16:21:07,669 INFO L895 garLoopResultBuilder]: At program point L5994(line 5994) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,669 INFO L899 garLoopResultBuilder]: For program point L5994-1(line 5994) no Hoare annotation was computed. [2022-11-21 16:21:07,669 INFO L899 garLoopResultBuilder]: For program point L6358(lines 6358 6364) no Hoare annotation was computed. [2022-11-21 16:21:07,669 INFO L895 garLoopResultBuilder]: At program point L5846(line 5846) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,669 INFO L899 garLoopResultBuilder]: For program point L5846-1(line 5846) no Hoare annotation was computed. [2022-11-21 16:21:07,669 INFO L899 garLoopResultBuilder]: For program point L5995(lines 5995 5998) no Hoare annotation was computed. [2022-11-21 16:21:07,669 INFO L899 garLoopResultBuilder]: For program point L6028-1(line 6028) no Hoare annotation was computed. [2022-11-21 16:21:07,670 INFO L895 garLoopResultBuilder]: At program point L6028(line 6028) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,670 INFO L899 garLoopResultBuilder]: For program point L5995-2(lines 5987 6004) no Hoare annotation was computed. [2022-11-21 16:21:07,670 INFO L895 garLoopResultBuilder]: At program point L6144(lines 6065 6166) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,670 INFO L895 garLoopResultBuilder]: At program point L5847(line 5847) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,670 INFO L899 garLoopResultBuilder]: For program point L5847-1(line 5847) no Hoare annotation was computed. [2022-11-21 16:21:07,671 INFO L899 garLoopResultBuilder]: For program point L5913(lines 5913 5916) no Hoare annotation was computed. [2022-11-21 16:21:07,671 INFO L899 garLoopResultBuilder]: For program point L6095(lines 6065 6166) no Hoare annotation was computed. [2022-11-21 16:21:07,671 INFO L899 garLoopResultBuilder]: For program point L6673-1(line 6673) no Hoare annotation was computed. [2022-11-21 16:21:07,671 INFO L895 garLoopResultBuilder]: At program point L6673(line 6673) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,671 INFO L895 garLoopResultBuilder]: At program point L5963(line 5963) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,671 INFO L899 garLoopResultBuilder]: For program point L5963-1(line 5963) no Hoare annotation was computed. [2022-11-21 16:21:07,671 INFO L899 garLoopResultBuilder]: For program point ldv_irq_1EXIT(lines 6349 6374) no Hoare annotation was computed. [2022-11-21 16:21:07,672 INFO L895 garLoopResultBuilder]: At program point L6046(lines 5885 6048) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,672 INFO L895 garLoopResultBuilder]: At program point L6013(line 6013) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,672 INFO L895 garLoopResultBuilder]: At program point L5980(lines 5960 5985) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,672 INFO L899 garLoopResultBuilder]: For program point L6013-1(line 6013) no Hoare annotation was computed. [2022-11-21 16:21:07,672 INFO L899 garLoopResultBuilder]: For program point L5848-1(line 5848) no Hoare annotation was computed. [2022-11-21 16:21:07,672 INFO L895 garLoopResultBuilder]: At program point L5881(line 5881) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,672 INFO L895 garLoopResultBuilder]: At program point L5848(line 5848) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,673 INFO L899 garLoopResultBuilder]: For program point L5881-1(line 5881) no Hoare annotation was computed. [2022-11-21 16:21:07,673 INFO L895 garLoopResultBuilder]: At program point L6674(lines 6669 6676) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,673 INFO L895 garLoopResultBuilder]: At program point L6096-2(lines 6096 6104) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (= |old(~last_index~0)| ~last_index~0)) [2022-11-21 16:21:07,673 INFO L899 garLoopResultBuilder]: For program point L6096(lines 6096 6104) no Hoare annotation was computed. [2022-11-21 16:21:07,673 INFO L899 garLoopResultBuilder]: For program point L6129-1(lines 6129 6136) no Hoare annotation was computed. [2022-11-21 16:21:07,673 INFO L899 garLoopResultBuilder]: For program point L6146(lines 6146 6149) no Hoare annotation was computed. [2022-11-21 16:21:07,674 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,674 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,674 INFO L895 garLoopResultBuilder]: At program point L6976(lines 6975 6977) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,674 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,674 INFO L895 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,675 INFO L895 garLoopResultBuilder]: At program point L6266(lines 6262 6268) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,675 INFO L895 garLoopResultBuilder]: At program point L6314(line 6314) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,675 INFO L902 garLoopResultBuilder]: At program point L7018(lines 7017 7019) the Hoare annotation is: true [2022-11-21 16:21:07,675 INFO L902 garLoopResultBuilder]: At program point L6316(lines 6311 6318) the Hoare annotation is: true [2022-11-21 16:21:07,675 INFO L899 garLoopResultBuilder]: For program point L6314-1(line 6314) no Hoare annotation was computed. [2022-11-21 16:21:07,675 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5300 5306) no Hoare annotation was computed. [2022-11-21 16:21:07,676 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5300 5306) the Hoare annotation is: true [2022-11-21 16:21:07,676 INFO L902 garLoopResultBuilder]: At program point L6938(lines 6937 6939) the Hoare annotation is: true [2022-11-21 16:21:07,676 INFO L902 garLoopResultBuilder]: At program point L6935(lines 6934 6936) the Hoare annotation is: true [2022-11-21 16:21:07,676 INFO L899 garLoopResultBuilder]: For program point sja1000_write_cmdregEXIT(lines 5534 5546) no Hoare annotation was computed. [2022-11-21 16:21:07,676 INFO L902 garLoopResultBuilder]: At program point sja1000_write_cmdregENTRY(lines 5534 5546) the Hoare annotation is: true [2022-11-21 16:21:07,676 INFO L902 garLoopResultBuilder]: At program point L5542(line 5542) the Hoare annotation is: true [2022-11-21 16:21:07,676 INFO L899 garLoopResultBuilder]: For program point sja1000_write_cmdregFINAL(lines 5534 5546) no Hoare annotation was computed. [2022-11-21 16:21:07,677 INFO L902 garLoopResultBuilder]: At program point L5224(lines 5220 5226) the Hoare annotation is: true [2022-11-21 16:21:07,677 INFO L902 garLoopResultBuilder]: At program point L5539(line 5539) the Hoare annotation is: true [2022-11-21 16:21:07,677 INFO L899 garLoopResultBuilder]: For program point L5539-1(line 5539) no Hoare annotation was computed. [2022-11-21 16:21:07,677 INFO L902 garLoopResultBuilder]: At program point L5541(line 5541) the Hoare annotation is: true [2022-11-21 16:21:07,677 INFO L899 garLoopResultBuilder]: For program point L5542-1(line 5542) no Hoare annotation was computed. [2022-11-21 16:21:07,677 INFO L899 garLoopResultBuilder]: For program point L5541-1(line 5541) no Hoare annotation was computed. [2022-11-21 16:21:07,678 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 5307 5312) no Hoare annotation was computed. [2022-11-21 16:21:07,678 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 5307 5312) the Hoare annotation is: true [2022-11-21 16:21:07,678 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 5307 5312) no Hoare annotation was computed. [2022-11-21 16:21:07,678 INFO L899 garLoopResultBuilder]: For program point netdev_privFINAL(lines 5371 5376) no Hoare annotation was computed. [2022-11-21 16:21:07,678 INFO L902 garLoopResultBuilder]: At program point netdev_privENTRY(lines 5371 5376) the Hoare annotation is: true [2022-11-21 16:21:07,678 INFO L899 garLoopResultBuilder]: For program point netdev_privEXIT(lines 5371 5376) no Hoare annotation was computed. [2022-11-21 16:21:07,679 INFO L899 garLoopResultBuilder]: For program point L6749-3(lines 6746 6775) no Hoare annotation was computed. [2022-11-21 16:21:07,679 INFO L895 garLoopResultBuilder]: At program point L6749-2(lines 6749 6760) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= 0 ldv_set_remove_~i~5) (= 0 (+ ldv_set_remove_~deleted_index~0 1)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0)) (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-21 16:21:07,679 INFO L899 garLoopResultBuilder]: For program point L6764-1(lines 6764 6767) no Hoare annotation was computed. [2022-11-21 16:21:07,679 INFO L899 garLoopResultBuilder]: For program point L6764(lines 6764 6767) no Hoare annotation was computed. [2022-11-21 16:21:07,679 INFO L899 garLoopResultBuilder]: For program point L6754(lines 6754 6758) no Hoare annotation was computed. [2022-11-21 16:21:07,679 INFO L899 garLoopResultBuilder]: For program point L6750(lines 6750 6753) no Hoare annotation was computed. [2022-11-21 16:21:07,680 INFO L895 garLoopResultBuilder]: At program point ldv_set_removeENTRY(lines 6742 6776) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-21 16:21:07,680 INFO L899 garLoopResultBuilder]: For program point L6750-1(lines 6750 6753) no Hoare annotation was computed. [2022-11-21 16:21:07,680 INFO L899 garLoopResultBuilder]: For program point L6763-3(lines 6763 6770) no Hoare annotation was computed. [2022-11-21 16:21:07,680 INFO L899 garLoopResultBuilder]: For program point L6761-1(lines 6742 6776) no Hoare annotation was computed. [2022-11-21 16:21:07,680 INFO L895 garLoopResultBuilder]: At program point L6763-2(lines 6763 6770) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0))) [2022-11-21 16:21:07,681 INFO L899 garLoopResultBuilder]: For program point ldv_set_removeEXIT(lines 6742 6776) no Hoare annotation was computed. [2022-11-21 16:21:07,681 INFO L899 garLoopResultBuilder]: For program point netdev_get_tx_queueEXIT(lines 5364 5370) no Hoare annotation was computed. [2022-11-21 16:21:07,681 INFO L902 garLoopResultBuilder]: At program point netdev_get_tx_queueENTRY(lines 5364 5370) the Hoare annotation is: true [2022-11-21 16:21:07,681 INFO L899 garLoopResultBuilder]: For program point netdev_get_tx_queueFINAL(lines 5364 5370) no Hoare annotation was computed. [2022-11-21 16:21:07,681 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~TO~~u8~0EXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,681 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~int~TO~~u8~0ENTRY(line -1) the Hoare annotation is: true [2022-11-21 16:21:07,682 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~TO~~u8~0FINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,682 INFO L899 garLoopResultBuilder]: For program point close_candevEXIT(lines 6969 6971) no Hoare annotation was computed. [2022-11-21 16:21:07,682 INFO L902 garLoopResultBuilder]: At program point close_candevENTRY(lines 6969 6971) the Hoare annotation is: true [2022-11-21 16:21:07,682 INFO L899 garLoopResultBuilder]: For program point close_candevFINAL(lines 6969 6971) no Hoare annotation was computed. [2022-11-21 16:21:07,682 INFO L899 garLoopResultBuilder]: For program point L5410-1(line 5410) no Hoare annotation was computed. [2022-11-21 16:21:07,682 INFO L899 garLoopResultBuilder]: For program point netif_wake_queueEXIT(lines 5406 5414) no Hoare annotation was computed. [2022-11-21 16:21:07,683 INFO L899 garLoopResultBuilder]: For program point L5399(lines 5399 5402) no Hoare annotation was computed. [2022-11-21 16:21:07,683 INFO L902 garLoopResultBuilder]: At program point L5399-2(lines 5394 5405) the Hoare annotation is: true [2022-11-21 16:21:07,683 INFO L902 garLoopResultBuilder]: At program point netif_wake_queueENTRY(lines 5406 5414) the Hoare annotation is: true [2022-11-21 16:21:07,683 INFO L902 garLoopResultBuilder]: At program point L5198(lines 5192 5200) the Hoare annotation is: true [2022-11-21 16:21:07,683 INFO L902 garLoopResultBuilder]: At program point L6928(lines 6927 6929) the Hoare annotation is: true [2022-11-21 16:21:07,683 INFO L902 garLoopResultBuilder]: At program point L5410(line 5410) the Hoare annotation is: true [2022-11-21 16:21:07,684 INFO L899 garLoopResultBuilder]: For program point netif_wake_queueFINAL(lines 5406 5414) no Hoare annotation was computed. [2022-11-21 16:21:07,684 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5240 5242) the Hoare annotation is: true [2022-11-21 16:21:07,684 INFO L899 garLoopResultBuilder]: For program point L5241-2(lines 5240 5242) no Hoare annotation was computed. [2022-11-21 16:21:07,684 INFO L899 garLoopResultBuilder]: For program point L5241(line 5241) no Hoare annotation was computed. [2022-11-21 16:21:07,684 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5240 5242) no Hoare annotation was computed. [2022-11-21 16:21:07,684 INFO L895 garLoopResultBuilder]: At program point ldv_skb_freeENTRY(lines 6863 6869) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-21 16:21:07,685 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeFINAL(lines 6863 6869) no Hoare annotation was computed. [2022-11-21 16:21:07,685 INFO L899 garLoopResultBuilder]: For program point ldv_skb_freeEXIT(lines 6863 6869) no Hoare annotation was computed. [2022-11-21 16:21:07,685 INFO L895 garLoopResultBuilder]: At program point L6866(line 6866) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= |old(~last_index~0)| 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))) [2022-11-21 16:21:07,685 INFO L902 garLoopResultBuilder]: At program point L5663(line 5663) the Hoare annotation is: true [2022-11-21 16:21:07,685 INFO L899 garLoopResultBuilder]: For program point L5663-1(line 5663) no Hoare annotation was computed. [2022-11-21 16:21:07,685 INFO L902 garLoopResultBuilder]: At program point L5634-2(lines 5634 5638) the Hoare annotation is: true [2022-11-21 16:21:07,686 INFO L895 garLoopResultBuilder]: At program point L5659(line 5659) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~ldv_state_variable_2~0 2)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,686 INFO L899 garLoopResultBuilder]: For program point L5626(lines 5626 5630) no Hoare annotation was computed. [2022-11-21 16:21:07,686 INFO L899 garLoopResultBuilder]: For program point L5639(line 5639) no Hoare annotation was computed. [2022-11-21 16:21:07,686 INFO L902 garLoopResultBuilder]: At program point L5635(line 5635) the Hoare annotation is: true [2022-11-21 16:21:07,686 INFO L899 garLoopResultBuilder]: For program point L5635-1(line 5635) no Hoare annotation was computed. [2022-11-21 16:21:07,686 INFO L899 garLoopResultBuilder]: For program point L5664-1(line 5664) no Hoare annotation was computed. [2022-11-21 16:21:07,687 INFO L902 garLoopResultBuilder]: At program point L5664(line 5664) the Hoare annotation is: true [2022-11-21 16:21:07,687 INFO L902 garLoopResultBuilder]: At program point L5627(line 5627) the Hoare annotation is: true [2022-11-21 16:21:07,687 INFO L899 garLoopResultBuilder]: For program point L5627-1(line 5627) no Hoare annotation was computed. [2022-11-21 16:21:07,687 INFO L899 garLoopResultBuilder]: For program point L5656-1(line 5656) no Hoare annotation was computed. [2022-11-21 16:21:07,687 INFO L895 garLoopResultBuilder]: At program point L5656(line 5656) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~ldv_state_variable_2~0 2)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,687 INFO L902 garLoopResultBuilder]: At program point L5619(line 5619) the Hoare annotation is: true [2022-11-21 16:21:07,688 INFO L899 garLoopResultBuilder]: For program point L5619-1(line 5619) no Hoare annotation was computed. [2022-11-21 16:21:07,688 INFO L899 garLoopResultBuilder]: For program point sja1000_startFINAL(lines 5651 5668) no Hoare annotation was computed. [2022-11-21 16:21:07,688 INFO L902 garLoopResultBuilder]: At program point L5648(lines 5609 5650) the Hoare annotation is: true [2022-11-21 16:21:07,688 INFO L902 garLoopResultBuilder]: At program point L5644(lines 5616 5649) the Hoare annotation is: true [2022-11-21 16:21:07,688 INFO L899 garLoopResultBuilder]: For program point L5640-1(line 5640) no Hoare annotation was computed. [2022-11-21 16:21:07,689 INFO L902 garLoopResultBuilder]: At program point L5640(line 5640) the Hoare annotation is: true [2022-11-21 16:21:07,689 INFO L899 garLoopResultBuilder]: For program point sja1000_startEXIT(lines 5651 5668) no Hoare annotation was computed. [2022-11-21 16:21:07,689 INFO L895 garLoopResultBuilder]: At program point sja1000_startENTRY(lines 5651 5668) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_retval_0~0 0)) (not (= ~ldv_state_variable_2~0 2)) (not (= ~last_index~0 0))) [2022-11-21 16:21:07,689 INFO L902 garLoopResultBuilder]: At program point L5637(line 5637) the Hoare annotation is: true [2022-11-21 16:21:07,689 INFO L899 garLoopResultBuilder]: For program point L5637-1(line 5637) no Hoare annotation was computed. [2022-11-21 16:21:07,689 INFO L902 garLoopResultBuilder]: At program point L5662(line 5662) the Hoare annotation is: true [2022-11-21 16:21:07,690 INFO L899 garLoopResultBuilder]: For program point L5658(lines 5658 5661) no Hoare annotation was computed. [2022-11-21 16:21:07,690 INFO L899 garLoopResultBuilder]: For program point L5662-1(line 5662) no Hoare annotation was computed. [2022-11-21 16:21:07,690 INFO L902 garLoopResultBuilder]: At program point L5629(line 5629) the Hoare annotation is: true [2022-11-21 16:21:07,690 INFO L899 garLoopResultBuilder]: For program point L5629-1(line 5629) no Hoare annotation was computed. [2022-11-21 16:21:07,690 INFO L899 garLoopResultBuilder]: For program point L5658-1(lines 5658 5661) no Hoare annotation was computed. [2022-11-21 16:21:07,690 INFO L902 garLoopResultBuilder]: At program point L5617(line 5617) the Hoare annotation is: true [2022-11-21 16:21:07,691 INFO L899 garLoopResultBuilder]: For program point L5617-1(line 5617) no Hoare annotation was computed. [2022-11-21 16:21:07,691 INFO L902 garLoopResultBuilder]: At program point L5642(lines 5616 5649) the Hoare annotation is: true [2022-11-21 16:21:07,691 INFO L899 garLoopResultBuilder]: For program point L5634(lines 5634 5638) no Hoare annotation was computed. [2022-11-21 16:21:07,691 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,691 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-11-21 16:21:07,691 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~int~X~~u8~0~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,691 INFO L902 garLoopResultBuilder]: At program point L5551(line 5551) the Hoare annotation is: true [2022-11-21 16:21:07,692 INFO L899 garLoopResultBuilder]: For program point L5551-1(line 5551) no Hoare annotation was computed. [2022-11-21 16:21:07,692 INFO L899 garLoopResultBuilder]: For program point sja1000_is_absentFINAL(lines 5547 5554) no Hoare annotation was computed. [2022-11-21 16:21:07,692 INFO L899 garLoopResultBuilder]: For program point sja1000_is_absentEXIT(lines 5547 5554) no Hoare annotation was computed. [2022-11-21 16:21:07,692 INFO L902 garLoopResultBuilder]: At program point sja1000_is_absentENTRY(lines 5547 5554) the Hoare annotation is: true [2022-11-21 16:21:07,692 INFO L899 garLoopResultBuilder]: For program point netif_stop_queueEXIT(lines 5437 5445) no Hoare annotation was computed. [2022-11-21 16:21:07,692 INFO L902 garLoopResultBuilder]: At program point L5182(lines 5178 5184) the Hoare annotation is: true [2022-11-21 16:21:07,693 INFO L902 garLoopResultBuilder]: At program point L5441(line 5441) the Hoare annotation is: true [2022-11-21 16:21:07,693 INFO L899 garLoopResultBuilder]: For program point L5441-1(line 5441) no Hoare annotation was computed. [2022-11-21 16:21:07,693 INFO L902 garLoopResultBuilder]: At program point L5434(lines 5415 5436) the Hoare annotation is: true [2022-11-21 16:21:07,693 INFO L899 garLoopResultBuilder]: For program point L5427(line 5427) no Hoare annotation was computed. [2022-11-21 16:21:07,693 INFO L902 garLoopResultBuilder]: At program point netif_stop_queueENTRY(lines 5437 5445) the Hoare annotation is: true [2022-11-21 16:21:07,693 INFO L899 garLoopResultBuilder]: For program point L5428(lines 5428 5432) no Hoare annotation was computed. [2022-11-21 16:21:07,694 INFO L899 garLoopResultBuilder]: For program point L5423(lines 5423 5426) no Hoare annotation was computed. [2022-11-21 16:21:07,694 INFO L902 garLoopResultBuilder]: At program point L5422(line 5422) the Hoare annotation is: true [2022-11-21 16:21:07,694 INFO L899 garLoopResultBuilder]: For program point L5422-1(line 5422) no Hoare annotation was computed. [2022-11-21 16:21:07,694 INFO L902 garLoopResultBuilder]: At program point L5423-2(lines 5423 5426) the Hoare annotation is: true [2022-11-21 16:21:07,694 INFO L902 garLoopResultBuilder]: At program point L7021(lines 7020 7022) the Hoare annotation is: true [2022-11-21 16:21:07,695 INFO L899 garLoopResultBuilder]: For program point netif_stop_queueFINAL(lines 5437 5445) no Hoare annotation was computed. [2022-11-21 16:21:07,695 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 5243 5259) the Hoare annotation is: (or (not (= ~ldv_retval_0~0 0)) (not (= ~last_index~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-21 16:21:07,695 INFO L902 garLoopResultBuilder]: At program point L5255(line 5255) the Hoare annotation is: true [2022-11-21 16:21:07,695 INFO L899 garLoopResultBuilder]: For program point L5255-1(line 5255) no Hoare annotation was computed. [2022-11-21 16:21:07,695 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5243 5259) no Hoare annotation was computed. [2022-11-21 16:21:07,695 INFO L899 garLoopResultBuilder]: For program point L5250(lines 5250 5257) no Hoare annotation was computed. [2022-11-21 16:21:07,695 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5243 5259) no Hoare annotation was computed. [2022-11-21 16:21:07,696 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,696 INFO L899 garLoopResultBuilder]: For program point L5272-1(line 5272) no Hoare annotation was computed. [2022-11-21 16:21:07,696 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 5260 5276) no Hoare annotation was computed. [2022-11-21 16:21:07,696 INFO L902 garLoopResultBuilder]: At program point L5272(line 5272) the Hoare annotation is: true [2022-11-21 16:21:07,696 INFO L899 garLoopResultBuilder]: For program point L5267(lines 5267 5274) no Hoare annotation was computed. [2022-11-21 16:21:07,697 INFO L895 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 5260 5276) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_retval_0~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) (.cse2 (not (= ~last_index~0 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_2~0 1)) .cse2) (or .cse0 .cse1 .cse2 (not (= ~ldv_state_variable_2~0 0)) (not (= ~ldv_irq_1_1~0 0))))) [2022-11-21 16:21:07,697 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 5260 5276) no Hoare annotation was computed. [2022-11-21 16:21:07,697 INFO L895 garLoopResultBuilder]: At program point L5783(line 5783) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,697 INFO L899 garLoopResultBuilder]: For program point L5783-1(line 5783) no Hoare annotation was computed. [2022-11-21 16:21:07,697 INFO L899 garLoopResultBuilder]: For program point L6510(lines 6510 6538) no Hoare annotation was computed. [2022-11-21 16:21:07,697 INFO L899 garLoopResultBuilder]: For program point L6543(line 6543) no Hoare annotation was computed. [2022-11-21 16:21:07,698 INFO L899 garLoopResultBuilder]: For program point L5486(lines 5486 5489) no Hoare annotation was computed. [2022-11-21 16:21:07,698 INFO L899 garLoopResultBuilder]: For program point L6576(line 6576) no Hoare annotation was computed. [2022-11-21 16:21:07,698 INFO L899 garLoopResultBuilder]: For program point L6609(line 6609) no Hoare annotation was computed. [2022-11-21 16:21:07,698 INFO L899 garLoopResultBuilder]: For program point L6378(lines 6378 6384) no Hoare annotation was computed. [2022-11-21 16:21:07,698 INFO L895 garLoopResultBuilder]: At program point L5354(lines 5347 5356) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,698 INFO L895 garLoopResultBuilder]: At program point L6213(line 6213) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,699 INFO L895 garLoopResultBuilder]: At program point L5189(lines 5185 5191) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,699 INFO L895 garLoopResultBuilder]: At program point L6213-1(line 6213) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,699 INFO L899 garLoopResultBuilder]: For program point L5784-1(line 5784) no Hoare annotation was computed. [2022-11-21 16:21:07,699 INFO L895 garLoopResultBuilder]: At program point L5784(line 5784) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,699 INFO L902 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: true [2022-11-21 16:21:07,699 INFO L899 garLoopResultBuilder]: For program point L6511(line 6511) no Hoare annotation was computed. [2022-11-21 16:21:07,700 INFO L899 garLoopResultBuilder]: For program point L6544(lines 6544 6607) no Hoare annotation was computed. [2022-11-21 16:21:07,700 INFO L899 garLoopResultBuilder]: For program point L6577(lines 6577 6581) no Hoare annotation was computed. [2022-11-21 16:21:07,700 INFO L899 garLoopResultBuilder]: For program point L6412(lines 6412 6415) no Hoare annotation was computed. [2022-11-21 16:21:07,700 INFO L899 garLoopResultBuilder]: For program point L6214(line 6214) no Hoare annotation was computed. [2022-11-21 16:21:07,700 INFO L895 garLoopResultBuilder]: At program point L5785(line 5785) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,700 INFO L899 garLoopResultBuilder]: For program point L5785-1(line 5785) no Hoare annotation was computed. [2022-11-21 16:21:07,700 INFO L899 garLoopResultBuilder]: For program point L6512(lines 6512 6517) no Hoare annotation was computed. [2022-11-21 16:21:07,701 INFO L895 garLoopResultBuilder]: At program point L5389(line 5389) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,701 INFO L899 garLoopResultBuilder]: For program point L5389-1(line 5389) no Hoare annotation was computed. [2022-11-21 16:21:07,701 INFO L899 garLoopResultBuilder]: For program point L6215(lines 6215 6218) no Hoare annotation was computed. [2022-11-21 16:21:07,701 INFO L895 garLoopResultBuilder]: At program point L6182(line 6182) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,701 INFO L895 garLoopResultBuilder]: At program point L6215-2(lines 6215 6218) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,701 INFO L899 garLoopResultBuilder]: For program point L6182-1(line 6182) no Hoare annotation was computed. [2022-11-21 16:21:07,702 INFO L899 garLoopResultBuilder]: For program point L6546(lines 6546 6604) no Hoare annotation was computed. [2022-11-21 16:21:07,702 INFO L895 garLoopResultBuilder]: At program point L6612(lines 6488 6617) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-21 16:21:07,702 INFO L899 garLoopResultBuilder]: For program point L6547(line 6547) no Hoare annotation was computed. [2022-11-21 16:21:07,702 INFO L895 garLoopResultBuilder]: At program point L5391(lines 5385 5393) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,702 INFO L899 garLoopResultBuilder]: For program point L6448-1(line 6448) no Hoare annotation was computed. [2022-11-21 16:21:07,703 INFO L895 garLoopResultBuilder]: At program point L6448(line 6448) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,703 INFO L899 garLoopResultBuilder]: For program point L6184-1(line 6184) no Hoare annotation was computed. [2022-11-21 16:21:07,703 INFO L895 garLoopResultBuilder]: At program point L6184(line 6184) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,703 INFO L899 garLoopResultBuilder]: For program point L5788-1(line 5788) no Hoare annotation was computed. [2022-11-21 16:21:07,703 INFO L895 garLoopResultBuilder]: At program point L5788(line 5788) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,703 INFO L895 garLoopResultBuilder]: At program point L6713(lines 6708 6715) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_irq_1_1~0 0)) [2022-11-21 16:21:07,704 INFO L899 garLoopResultBuilder]: For program point L6548(lines 6548 6552) no Hoare annotation was computed. [2022-11-21 16:21:07,704 INFO L895 garLoopResultBuilder]: At program point L6416(lines 6409 6418) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,704 INFO L895 garLoopResultBuilder]: At program point L5789(line 5789) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,704 INFO L899 garLoopResultBuilder]: For program point L5789-1(line 5789) no Hoare annotation was computed. [2022-11-21 16:21:07,704 INFO L895 garLoopResultBuilder]: At program point L6450(lines 6444 6452) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,704 INFO L899 garLoopResultBuilder]: For program point L5492-1(lines 5480 5506) no Hoare annotation was computed. [2022-11-21 16:21:07,705 INFO L899 garLoopResultBuilder]: For program point L5492(lines 5492 5506) no Hoare annotation was computed. [2022-11-21 16:21:07,705 INFO L895 garLoopResultBuilder]: At program point L6219(line 6219) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,705 INFO L899 garLoopResultBuilder]: For program point L6186(lines 6186 6189) no Hoare annotation was computed. [2022-11-21 16:21:07,705 INFO L895 garLoopResultBuilder]: At program point L6979(lines 6978 6980) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,705 INFO L895 garLoopResultBuilder]: At program point L5790(line 5790) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,705 INFO L899 garLoopResultBuilder]: For program point L6913(lines 6913 6916) no Hoare annotation was computed. [2022-11-21 16:21:07,706 INFO L899 garLoopResultBuilder]: For program point L5790-1(line 5790) no Hoare annotation was computed. [2022-11-21 16:21:07,706 INFO L899 garLoopResultBuilder]: For program point L6583(line 6583) no Hoare annotation was computed. [2022-11-21 16:21:07,706 INFO L902 garLoopResultBuilder]: At program point L6616(lines 6479 6618) the Hoare annotation is: true [2022-11-21 16:21:07,706 INFO L895 garLoopResultBuilder]: At program point L5493(line 5493) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,706 INFO L899 garLoopResultBuilder]: For program point L5493-1(line 5493) no Hoare annotation was computed. [2022-11-21 16:21:07,706 INFO L899 garLoopResultBuilder]: For program point L6385(lines 6385 6391) no Hoare annotation was computed. [2022-11-21 16:21:07,707 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-11-21 16:21:07,707 INFO L899 garLoopResultBuilder]: For program point L5494(lines 5494 5503) no Hoare annotation was computed. [2022-11-21 16:21:07,707 INFO L899 garLoopResultBuilder]: For program point L6584(lines 6584 6592) no Hoare annotation was computed. [2022-11-21 16:21:07,707 INFO L895 garLoopResultBuilder]: At program point L6221(lines 6206 6223) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,707 INFO L902 garLoopResultBuilder]: At program point L6915-1(lines 6908 6919) the Hoare annotation is: true [2022-11-21 16:21:07,707 INFO L895 garLoopResultBuilder]: At program point L6915(line 6915) the Hoare annotation is: false [2022-11-21 16:21:07,707 INFO L899 garLoopResultBuilder]: For program point L6519(line 6519) no Hoare annotation was computed. [2022-11-21 16:21:07,708 INFO L895 garLoopResultBuilder]: At program point L7015(lines 7014 7016) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,708 INFO L899 garLoopResultBuilder]: For program point L6586(lines 6586 6590) no Hoare annotation was computed. [2022-11-21 16:21:07,708 INFO L899 garLoopResultBuilder]: For program point L6520(lines 6520 6534) no Hoare annotation was computed. [2022-11-21 16:21:07,708 INFO L899 garLoopResultBuilder]: For program point L6190(lines 6190 6199) no Hoare annotation was computed. [2022-11-21 16:21:07,708 INFO L895 garLoopResultBuilder]: At program point L6190-2(lines 6190 6199) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,709 INFO L895 garLoopResultBuilder]: At program point L6983(lines 6982 6984) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,709 INFO L899 garLoopResultBuilder]: For program point L6554(line 6554) no Hoare annotation was computed. [2022-11-21 16:21:07,709 INFO L895 garLoopResultBuilder]: At program point L5497(lines 5497 5498) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,709 INFO L899 garLoopResultBuilder]: For program point L5497-1(lines 5497 5498) no Hoare annotation was computed. [2022-11-21 16:21:07,709 INFO L895 garLoopResultBuilder]: At program point L5762(line 5762) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,709 INFO L899 garLoopResultBuilder]: For program point L5762-1(line 5762) no Hoare annotation was computed. [2022-11-21 16:21:07,709 INFO L899 garLoopResultBuilder]: For program point L6522(lines 6522 6527) no Hoare annotation was computed. [2022-11-21 16:21:07,710 INFO L899 garLoopResultBuilder]: For program point L6555(lines 6555 6559) no Hoare annotation was computed. [2022-11-21 16:21:07,710 INFO L899 garLoopResultBuilder]: For program point L6522-2(lines 6520 6533) no Hoare annotation was computed. [2022-11-21 16:21:07,710 INFO L899 garLoopResultBuilder]: For program point L6456(lines 6456 6460) no Hoare annotation was computed. [2022-11-21 16:21:07,710 INFO L899 garLoopResultBuilder]: For program point L6555-2(lines 6546 6604) no Hoare annotation was computed. [2022-11-21 16:21:07,710 INFO L899 garLoopResultBuilder]: For program point L5499(lines 5499 5502) no Hoare annotation was computed. [2022-11-21 16:21:07,710 INFO L899 garLoopResultBuilder]: For program point L6556-1(line 6556) no Hoare annotation was computed. [2022-11-21 16:21:07,711 INFO L895 garLoopResultBuilder]: At program point L6556(line 6556) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,711 INFO L899 garLoopResultBuilder]: For program point L6424(lines 6424 6439) no Hoare annotation was computed. [2022-11-21 16:21:07,711 INFO L899 garLoopResultBuilder]: For program point L6193(lines 6193 6197) no Hoare annotation was computed. [2022-11-21 16:21:07,711 INFO L895 garLoopResultBuilder]: At program point L5797(line 5797) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,711 INFO L899 garLoopResultBuilder]: For program point L5797-1(line 5797) no Hoare annotation was computed. [2022-11-21 16:21:07,711 INFO L899 garLoopResultBuilder]: For program point L6689-2(lines 6689 6692) no Hoare annotation was computed. [2022-11-21 16:21:07,712 INFO L899 garLoopResultBuilder]: For program point L6689(lines 6689 6692) no Hoare annotation was computed. [2022-11-21 16:21:07,712 INFO L899 garLoopResultBuilder]: For program point L6491-1(line 6491) no Hoare annotation was computed. [2022-11-21 16:21:07,712 INFO L895 garLoopResultBuilder]: At program point L6491(line 6491) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_irq_1_1~0 0)) [2022-11-21 16:21:07,712 INFO L899 garLoopResultBuilder]: For program point L6392(lines 6392 6398) no Hoare annotation was computed. [2022-11-21 16:21:07,712 INFO L899 garLoopResultBuilder]: For program point L6425(line 6425) no Hoare annotation was computed. [2022-11-21 16:21:07,712 INFO L895 garLoopResultBuilder]: At program point L6194(line 6194) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,713 INFO L899 garLoopResultBuilder]: For program point L6194-1(line 6194) no Hoare annotation was computed. [2022-11-21 16:21:07,713 INFO L895 garLoopResultBuilder]: At program point L6987(lines 6986 6988) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,713 INFO L895 garLoopResultBuilder]: At program point L6657-1(lines 6654 6660) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,713 INFO L895 garLoopResultBuilder]: At program point L6657(line 6657) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,713 INFO L895 garLoopResultBuilder]: At program point L6426(line 6426) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-21 16:21:07,714 INFO L899 garLoopResultBuilder]: For program point L6426-1(line 6426) no Hoare annotation was computed. [2022-11-21 16:21:07,714 INFO L895 garLoopResultBuilder]: At program point L5799(lines 5761 5811) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,714 INFO L899 garLoopResultBuilder]: For program point L5766(lines 5766 5769) no Hoare annotation was computed. [2022-11-21 16:21:07,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,714 INFO L899 garLoopResultBuilder]: For program point L6428(line 6428) no Hoare annotation was computed. [2022-11-21 16:21:07,714 INFO L899 garLoopResultBuilder]: For program point L6461(lines 6461 6465) no Hoare annotation was computed. [2022-11-21 16:21:07,715 INFO L895 garLoopResultBuilder]: At program point L5801(lines 5761 5811) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,715 INFO L899 garLoopResultBuilder]: For program point L6594(line 6594) no Hoare annotation was computed. [2022-11-21 16:21:07,715 INFO L895 garLoopResultBuilder]: At program point L6693(lines 6677 6695) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,715 INFO L899 garLoopResultBuilder]: For program point L6561-1(line 6561) no Hoare annotation was computed. [2022-11-21 16:21:07,715 INFO L895 garLoopResultBuilder]: At program point L6561(line 6561) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,715 INFO L899 garLoopResultBuilder]: For program point L6429-1(line 6429) no Hoare annotation was computed. [2022-11-21 16:21:07,716 INFO L895 garLoopResultBuilder]: At program point L6429(line 6429) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-21 16:21:07,716 INFO L899 garLoopResultBuilder]: For program point L6595(lines 6595 6600) no Hoare annotation was computed. [2022-11-21 16:21:07,716 INFO L895 garLoopResultBuilder]: At program point L5505(lines 5478 5512) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,716 INFO L895 garLoopResultBuilder]: At program point L5770(line 5770) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,716 INFO L895 garLoopResultBuilder]: At program point L6860(lines 6856 6862) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_irq_1_1~0 0)) [2022-11-21 16:21:07,716 INFO L899 garLoopResultBuilder]: For program point L5770-1(line 5770) no Hoare annotation was computed. [2022-11-21 16:21:07,717 INFO L895 garLoopResultBuilder]: At program point L6530(lines 6488 6617) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,717 INFO L899 garLoopResultBuilder]: For program point L6431(line 6431) no Hoare annotation was computed. [2022-11-21 16:21:07,717 INFO L895 garLoopResultBuilder]: At program point L6332(lines 6328 6334) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,717 INFO L895 garLoopResultBuilder]: At program point L6200(line 6200) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,717 INFO L899 garLoopResultBuilder]: For program point L6432-1(line 6432) no Hoare annotation was computed. [2022-11-21 16:21:07,717 INFO L899 garLoopResultBuilder]: For program point L6399(lines 6399 6405) no Hoare annotation was computed. [2022-11-21 16:21:07,718 INFO L895 garLoopResultBuilder]: At program point L6432(line 6432) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-21 16:21:07,718 INFO L899 garLoopResultBuilder]: For program point L6201(line 6201) no Hoare annotation was computed. [2022-11-21 16:21:07,718 INFO L899 garLoopResultBuilder]: For program point L5805(lines 5805 5809) no Hoare annotation was computed. [2022-11-21 16:21:07,718 INFO L899 garLoopResultBuilder]: For program point L6466(lines 6466 6470) no Hoare annotation was computed. [2022-11-21 16:21:07,718 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,718 INFO L895 garLoopResultBuilder]: At program point L5806(line 5806) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,719 INFO L899 garLoopResultBuilder]: For program point L6566(line 6566) no Hoare annotation was computed. [2022-11-21 16:21:07,719 INFO L899 garLoopResultBuilder]: For program point L6434(line 6434) no Hoare annotation was computed. [2022-11-21 16:21:07,719 INFO L899 garLoopResultBuilder]: For program point L6500(lines 6500 6611) no Hoare annotation was computed. [2022-11-21 16:21:07,719 INFO L895 garLoopResultBuilder]: At program point L6203(lines 6176 6205) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,719 INFO L899 garLoopResultBuilder]: For program point L5774(lines 5774 5777) no Hoare annotation was computed. [2022-11-21 16:21:07,719 INFO L899 garLoopResultBuilder]: For program point L5774-2(lines 5761 5811) no Hoare annotation was computed. [2022-11-21 16:21:07,720 INFO L899 garLoopResultBuilder]: For program point L6567(lines 6567 6574) no Hoare annotation was computed. [2022-11-21 16:21:07,720 INFO L899 garLoopResultBuilder]: For program point L6435-1(line 6435) no Hoare annotation was computed. [2022-11-21 16:21:07,720 INFO L895 garLoopResultBuilder]: At program point L6435(line 6435) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-21 16:21:07,720 INFO L899 garLoopResultBuilder]: For program point L6501(line 6501) no Hoare annotation was computed. [2022-11-21 16:21:07,720 INFO L899 garLoopResultBuilder]: For program point L5808-1(lines 5805 5809) no Hoare annotation was computed. [2022-11-21 16:21:07,720 INFO L895 garLoopResultBuilder]: At program point L5808(line 5808) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,721 INFO L899 garLoopResultBuilder]: For program point L6502(lines 6502 6505) no Hoare annotation was computed. [2022-11-21 16:21:07,721 INFO L895 garLoopResultBuilder]: At program point L5511(lines 5471 5513) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,721 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,721 INFO L899 garLoopResultBuilder]: For program point L6602(line 6602) no Hoare annotation was computed. [2022-11-21 16:21:07,721 INFO L895 garLoopResultBuilder]: At program point L6701(lines 6696 6703) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,721 INFO L899 garLoopResultBuilder]: For program point L6536(line 6536) no Hoare annotation was computed. [2022-11-21 16:21:07,721 INFO L899 garLoopResultBuilder]: For program point L6569(lines 6569 6572) no Hoare annotation was computed. [2022-11-21 16:21:07,722 INFO L899 garLoopResultBuilder]: For program point L6437(line 6437) no Hoare annotation was computed. [2022-11-21 16:21:07,722 INFO L895 garLoopResultBuilder]: At program point L5810(lines 5749 5812) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,722 INFO L895 garLoopResultBuilder]: At program point L6801(lines 6798 6803) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,722 INFO L902 garLoopResultBuilder]: At program point L6603(line 6603) the Hoare annotation is: true [2022-11-21 16:21:07,722 INFO L902 garLoopResultBuilder]: At program point L6438(line 6438) the Hoare annotation is: true [2022-11-21 16:21:07,722 INFO L899 garLoopResultBuilder]: For program point L6471(lines 6471 6475) no Hoare annotation was computed. [2022-11-21 16:21:07,723 INFO L902 garLoopResultBuilder]: At program point L6537(line 6537) the Hoare annotation is: true [2022-11-21 16:21:07,723 INFO L899 garLoopResultBuilder]: For program point L5480(lines 5480 5506) no Hoare annotation was computed. [2022-11-21 16:21:07,723 INFO L895 garLoopResultBuilder]: At program point L6339(lines 6335 6341) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,723 INFO L895 garLoopResultBuilder]: At program point L6967(lines 6966 6968) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,723 INFO L899 garLoopResultBuilder]: For program point L5778-1(lines 5778 5791) no Hoare annotation was computed. [2022-11-21 16:21:07,723 INFO L895 garLoopResultBuilder]: At program point L6406(lines 6375 6408) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,724 INFO L895 garLoopResultBuilder]: At program point L5382(lines 5378 5384) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,724 INFO L895 garLoopResultBuilder]: At program point L5481(line 5481) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,724 INFO L899 garLoopResultBuilder]: For program point L5481-1(line 5481) no Hoare annotation was computed. [2022-11-21 16:21:07,724 INFO L899 garLoopResultBuilder]: For program point L5482(lines 5482 5490) no Hoare annotation was computed. [2022-11-21 16:21:07,724 INFO L895 garLoopResultBuilder]: At program point L6440(lines 6419 6443) the Hoare annotation is: (let ((.cse0 (= ~ldv_retval_0~0 0)) (.cse1 (= ~last_index~0 0))) (or (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) .cse0 .cse1) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_2~0 0) .cse0 .cse1 (= ~ldv_irq_1_1~0 0)))) [2022-11-21 16:21:07,724 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:21:07,725 INFO L899 garLoopResultBuilder]: For program point L6507(line 6507) no Hoare annotation was computed. [2022-11-21 16:21:07,725 INFO L895 garLoopResultBuilder]: At program point L7003(lines 7002 7004) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0) (= ~ldv_state_variable_2~0 2)) [2022-11-21 16:21:07,725 INFO L895 garLoopResultBuilder]: At program point L5781(line 5781) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,725 INFO L899 garLoopResultBuilder]: For program point L5781-1(line 5781) no Hoare annotation was computed. [2022-11-21 16:21:07,725 INFO L899 garLoopResultBuilder]: For program point L6508(lines 6508 6541) no Hoare annotation was computed. [2022-11-21 16:21:07,725 INFO L895 garLoopResultBuilder]: At program point L6211(line 6211) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,726 INFO L899 garLoopResultBuilder]: For program point L6211-1(line 6211) no Hoare annotation was computed. [2022-11-21 16:21:07,726 INFO L895 garLoopResultBuilder]: At program point L5782(line 5782) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,726 INFO L899 garLoopResultBuilder]: For program point L5782-1(line 5782) no Hoare annotation was computed. [2022-11-21 16:21:07,726 INFO L895 garLoopResultBuilder]: At program point L6476(lines 6453 6478) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,726 INFO L895 garLoopResultBuilder]: At program point L5485(line 5485) the Hoare annotation is: (and (= |ULTIMATE.start_sja1000_init_#res#1| 0) (= ~ldv_retval_0~0 0) (= ~last_index~0 0)) [2022-11-21 16:21:07,726 INFO L899 garLoopResultBuilder]: For program point L5485-1(line 5485) no Hoare annotation was computed. [2022-11-21 16:21:07,727 INFO L902 garLoopResultBuilder]: At program point spinlock_checkENTRY(lines 5214 5219) the Hoare annotation is: true [2022-11-21 16:21:07,727 INFO L899 garLoopResultBuilder]: For program point spinlock_checkEXIT(lines 5214 5219) no Hoare annotation was computed. [2022-11-21 16:21:07,727 INFO L899 garLoopResultBuilder]: For program point spinlock_checkFINAL(lines 5214 5219) no Hoare annotation was computed. [2022-11-21 16:21:07,727 INFO L899 garLoopResultBuilder]: For program point can_change_mtuFINAL(lines 6953 6955) no Hoare annotation was computed. [2022-11-21 16:21:07,727 INFO L902 garLoopResultBuilder]: At program point can_change_mtuENTRY(lines 6953 6955) the Hoare annotation is: true [2022-11-21 16:21:07,727 INFO L899 garLoopResultBuilder]: For program point can_change_mtuEXIT(lines 6953 6955) no Hoare annotation was computed. [2022-11-21 16:21:07,728 INFO L899 garLoopResultBuilder]: For program point can_led_eventFINAL(lines 6963 6965) no Hoare annotation was computed. [2022-11-21 16:21:07,728 INFO L902 garLoopResultBuilder]: At program point can_led_eventENTRY(lines 6963 6965) the Hoare annotation is: true [2022-11-21 16:21:07,728 INFO L899 garLoopResultBuilder]: For program point can_led_eventEXIT(lines 6963 6965) no Hoare annotation was computed. [2022-11-21 16:21:07,731 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:21:07,733 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:21:07,747 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,748 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,748 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,748 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,749 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,749 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,749 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,749 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,755 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,755 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,755 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,756 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,756 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,756 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,756 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,757 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,759 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,760 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,760 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,760 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,761 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,761 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,761 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,761 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,762 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,762 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,763 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,763 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,763 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,763 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,764 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,764 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,765 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,765 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,765 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,765 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,766 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,766 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,766 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,766 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,768 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,768 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,768 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,768 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,769 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,769 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:07,769 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,770 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:07,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:21:07 BoogieIcfgContainer [2022-11-21 16:21:07,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:21:07,771 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:21:07,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:21:07,771 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:21:07,772 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:19:00" (3/4) ... [2022-11-21 16:21:07,775 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 16:21:07,781 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free_int [2022-11-21 16:21:07,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2022-11-21 16:21:07,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure set_reset_mode [2022-11-21 16:21:07,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-21 16:21:07,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_irq_1 [2022-11-21 16:21:07,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-11-21 16:21:07,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-21 16:21:07,782 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_write_cmdreg [2022-11-21 16:21:07,783 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2022-11-21 16:21:07,783 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netdev_priv [2022-11-21 16:21:07,783 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_set_remove [2022-11-21 16:21:07,783 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netdev_get_tx_queue [2022-11-21 16:21:07,783 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~int~TO~~u8~0 [2022-11-21 16:21:07,783 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure close_candev [2022-11-21 16:21:07,783 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_wake_queue [2022-11-21 16:21:07,783 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-21 16:21:07,784 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_skb_free [2022-11-21 16:21:07,784 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_start [2022-11-21 16:21:07,784 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~int~X~~u8~0~TO~VOID [2022-11-21 16:21:07,784 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sja1000_is_absent [2022-11-21 16:21:07,784 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_stop_queue [2022-11-21 16:21:07,784 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-21 16:21:07,784 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-11-21 16:21:07,785 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2022-11-21 16:21:07,785 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_change_mtu [2022-11-21 16:21:07,785 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_led_event [2022-11-21 16:21:07,805 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 180 nodes and edges [2022-11-21 16:21:07,807 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2022-11-21 16:21:07,809 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-21 16:21:07,812 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-21 16:21:07,814 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-21 16:21:07,816 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 16:21:07,819 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:21:07,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_state_variable_2 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) || ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_1 == 0) [2022-11-21 16:21:07,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,850 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,850 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,850 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && 1 <= \result) && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,850 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,852 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,852 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,853 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) || ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_1 == 0) [2022-11-21 16:21:07,853 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || ((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(LDV_IN_INTERRUPT) == LDV_IN_INTERRUPT) && \old(last_index) == last_index) [2022-11-21 16:21:07,853 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,853 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) [2022-11-21 16:21:07,853 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) [2022-11-21 16:21:07,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_state_variable_0 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,858 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,858 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,858 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) [2022-11-21 16:21:07,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:07,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:07,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) [2022-11-21 16:21:07,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_state_variable_2 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 <= i) && 0 == deleted_index + 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(last_index) == last_index) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) [2022-11-21 16:21:07,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:07,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(ldv_retval_0 == 0) || !(\old(last_index) == 0) [2022-11-21 16:21:07,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:07,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:07,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index [2022-11-21 16:21:07,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 [2022-11-21 16:21:07,864 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:07,864 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:07,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:07,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:07,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:07,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 [2022-11-21 16:21:08,003 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:21:08,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:21:08,004 INFO L158 Benchmark]: Toolchain (without parser) took 132333.94ms. Allocated memory was 140.5MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 95.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 388.2MB. Max. memory is 16.1GB. [2022-11-21 16:21:08,004 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory was 53.4MB in the beginning and 53.3MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:21:08,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2065.01ms. Allocated memory was 140.5MB in the beginning and 182.5MB in the end (delta: 41.9MB). Free memory was 95.8MB in the beginning and 84.6MB in the end (delta: 11.1MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2022-11-21 16:21:08,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 185.56ms. Allocated memory is still 182.5MB. Free memory was 84.6MB in the beginning and 72.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 16:21:08,005 INFO L158 Benchmark]: Boogie Preprocessor took 141.19ms. Allocated memory is still 182.5MB. Free memory was 72.1MB in the beginning and 115.2MB in the end (delta: -43.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-21 16:21:08,006 INFO L158 Benchmark]: RCFGBuilder took 2431.86ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 115.2MB in the beginning and 151.7MB in the end (delta: -36.4MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2022-11-21 16:21:08,006 INFO L158 Benchmark]: TraceAbstraction took 127266.59ms. Allocated memory was 245.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 151.7MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-21 16:21:08,007 INFO L158 Benchmark]: Witness Printer took 232.72ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-21 16:21:08,008 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.27ms. Allocated memory is still 104.9MB. Free memory was 53.4MB in the beginning and 53.3MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2065.01ms. Allocated memory was 140.5MB in the beginning and 182.5MB in the end (delta: 41.9MB). Free memory was 95.8MB in the beginning and 84.6MB in the end (delta: 11.1MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 185.56ms. Allocated memory is still 182.5MB. Free memory was 84.6MB in the beginning and 72.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.19ms. Allocated memory is still 182.5MB. Free memory was 72.1MB in the beginning and 115.2MB in the end (delta: -43.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2431.86ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 115.2MB in the beginning and 151.7MB in the end (delta: -36.4MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. * TraceAbstraction took 127266.59ms. Allocated memory was 245.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 151.7MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 232.72ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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 - PositiveResult [Line: 5297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 506 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 127.1s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 34.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 85.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12217 SdHoareTripleChecker+Valid, 29.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11310 mSDsluCounter, 19888 SdHoareTripleChecker+Invalid, 25.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13491 mSDsCounter, 6526 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15396 IncrementalHoareTripleChecker+Invalid, 21922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6526 mSolverCounterUnsat, 6397 mSDtfsCounter, 15396 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6681occurred in iteration=9, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 11285 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 212 LocationsWithAnnotation, 32313 PreInvPairs, 35778 NumberOfFragments, 2234 HoareAnnotationTreeSize, 32313 FomulaSimplifications, 301056 FormulaSimplificationTreeSizeReduction, 64.5s HoareSimplificationTime, 212 FomulaSimplificationsInter, 2062841 FormulaSimplificationTreeSizeReductionInter, 20.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 831 ConstructedInterpolants, 0 QuantifiedInterpolants, 1651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 241/241 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5960]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 5378]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 5415]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6763]: Loop Invariant Derived loop invariant: !(ldv_retval_0 == 0) || !(\old(last_index) == 0) - InvariantResult [Line: 6654]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6940]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6065]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 5192]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6960]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6262]: Loop Invariant [2022-11-21 16:21:08,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,044 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) - InvariantResult [Line: 5813]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6065]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6065]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6444]: Loop Invariant Derived loop invariant: ((ldv_state_variable_2 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 7017]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6856]: Loop Invariant Derived loop invariant: ((ldv_state_variable_2 == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_1 == 0 - InvariantResult [Line: 6708]: Loop Invariant Derived loop invariant: ((ldv_state_variable_2 == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_1 == 0 - InvariantResult [Line: 6798]: Loop Invariant Derived loop invariant: ((\result == 0 && 1 <= \result) && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6982]: Loop Invariant Derived loop invariant: ((ldv_state_variable_2 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 7014]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 5862]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 5862]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6049]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 5885]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6966]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 7020]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5761]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6669]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6453]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5385]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 5178]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6934]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7002]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6109]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6949]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 5749]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5471]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5347]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6927]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6975]: Loop Invariant [2022-11-21 16:21:08,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,060 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,061 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) - InvariantResult [Line: 6206]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5616]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5609]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5185]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6479]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5394]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6978]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6375]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6661]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 5300]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6328]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && \result == 0) && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6109]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 6677]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6488]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5478]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5616]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6311]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6176]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 5582]: Loop Invariant [2022-11-21 16:21:08,068 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,068 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,068 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,068 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,068 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,069 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,069 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,069 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) - InvariantResult [Line: 6335]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 5761]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6956]: Loop Invariant Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || \old(last_index) == last_index - InvariantResult [Line: 5582]: Loop Invariant [2022-11-21 16:21:08,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(ldv_retval_0 == 0)) || !(last_index == 0) - InvariantResult [Line: 6986]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6354]: Loop Invariant [2022-11-21 16:21:08,075 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (!(ldv_retval_0 == 0) || !(\old(last_index) == 0)) || ((((((\old(unknown-#length-unknown) == unknown-#length-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && \old(LDV_IN_INTERRUPT) == LDV_IN_INTERRUPT) && \old(last_index) == last_index) - InvariantResult [Line: 6419]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) || ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_1 == 0) - InvariantResult [Line: 6488]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) || ((((ldv_state_variable_0 == 1 && ldv_state_variable_2 == 0) && ldv_retval_0 == 0) && last_index == 0) && ldv_irq_1_1 == 0) - InvariantResult [Line: 5220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6696]: Loop Invariant Derived loop invariant: (\result == 0 && ldv_retval_0 == 0) && last_index == 0 - InvariantResult [Line: 6937]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6409]: Loop Invariant Derived loop invariant: ((\result == 0 && ldv_retval_0 == 0) && last_index == 0) && ldv_state_variable_2 == 2 - InvariantResult [Line: 6749]: Loop Invariant [2022-11-21 16:21:08,079 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,079 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,079 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,079 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,080 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,080 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-21 16:21:08,080 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-21 16:21:08,080 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 <= i) && 0 == deleted_index + 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(last_index) == last_index) || !(ldv_retval_0 == 0)) || !(\old(last_index) == 0) - InvariantResult [Line: 6908]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-21 16:21:08,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb751fd-4efd-4ed7-9f10-5d2fae82ca2b/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE