./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:22:14,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:22:14,247 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-11-13 21:22:14,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:22:14,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:22:14,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:22:14,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:22:14,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:22:14,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:22:14,296 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:22:14,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:22:14,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:22:14,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:22:14,296 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 21:22:14,296 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 21:22:14,296 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 21:22:14,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:22:14,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:22:14,297 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 21:22:14,297 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:22:14,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:22:14,297 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:22:14,297 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:22:14,297 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:22:14,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:22:14,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:22:14,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:22:14,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:22:14,298 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:22:14,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:22:14,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2024-11-13 21:22:14,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:22:14,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:22:14,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:22:14,658 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:22:14,659 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:22:14,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i Unable to find full path for "g++" [2024-11-13 21:22:16,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:22:17,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:22:17,008 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-13 21:22:17,031 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/data/2556c3442/f35d8f1c87ab491aa20c15896e9f123a/FLAGdee07ab00 [2024-11-13 21:22:17,214 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/data/2556c3442/f35d8f1c87ab491aa20c15896e9f123a [2024-11-13 21:22:17,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:22:17,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:22:17,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:22:17,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:22:17,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:22:17,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0805b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17, skipping insertion in model container [2024-11-13 21:22:17,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:22:17,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:22:17,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:22:17,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:22:17,768 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:22:17,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17 WrapperNode [2024-11-13 21:22:17,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:22:17,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:22:17,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:22:17,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:22:17,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,839 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2024-11-13 21:22:17,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:22:17,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:22:17,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:22:17,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:22:17,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:22:17,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:22:17,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:22:17,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:22:17,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:22:17" (1/1) ... [2024-11-13 21:22:17,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:22:17,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:22:17,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:22:17,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:22:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 21:22:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 21:22:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 21:22:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 21:22:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:22:17,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:22:18,137 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:22:18,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:22:18,648 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-13 21:22:18,648 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:22:18,699 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:22:18,699 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:22:18,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:22:18 BoogieIcfgContainer [2024-11-13 21:22:18,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:22:18,701 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:22:18,701 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:22:18,715 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:22:18,715 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:22:18" (1/1) ... [2024-11-13 21:22:18,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:22:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 129 states and 136 transitions. [2024-11-13 21:22:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2024-11-13 21:22:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 21:22:18,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:18,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 128 states and 135 transitions. [2024-11-13 21:22:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2024-11-13 21:22:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 21:22:19,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:19,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 127 states and 134 transitions. [2024-11-13 21:22:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2024-11-13 21:22:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 21:22:19,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:19,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 126 states and 133 transitions. [2024-11-13 21:22:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2024-11-13 21:22:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 21:22:19,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:19,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 125 states and 132 transitions. [2024-11-13 21:22:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2024-11-13 21:22:19,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:22:19,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:19,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 126 states and 134 transitions. [2024-11-13 21:22:20,097 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2024-11-13 21:22:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:22:20,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:20,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 125 states and 133 transitions. [2024-11-13 21:22:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2024-11-13 21:22:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:22:20,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:20,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 124 states and 132 transitions. [2024-11-13 21:22:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-11-13 21:22:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:22:20,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:20,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 128 states and 140 transitions. [2024-11-13 21:22:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-11-13 21:22:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:22:21,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 132 states and 151 transitions. [2024-11-13 21:22:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2024-11-13 21:22:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:22:22,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 136 states and 156 transitions. [2024-11-13 21:22:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2024-11-13 21:22:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:22:23,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:23,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 136 states and 155 transitions. [2024-11-13 21:22:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2024-11-13 21:22:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:22:23,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:23,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 136 states and 154 transitions. [2024-11-13 21:22:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2024-11-13 21:22:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:22:24,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 137 states and 157 transitions. [2024-11-13 21:22:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2024-11-13 21:22:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:22:24,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 126 states and 134 transitions. [2024-11-13 21:22:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2024-11-13 21:22:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:22:24,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:22:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 136 states and 151 transitions. [2024-11-13 21:22:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-13 21:22:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:22:26,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 146 states and 168 transitions. [2024-11-13 21:22:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2024-11-13 21:22:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:22:29,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:29,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:22:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 147 states and 170 transitions. [2024-11-13 21:22:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2024-11-13 21:22:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:22:30,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:30,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:22:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 148 states and 172 transitions. [2024-11-13 21:22:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2024-11-13 21:22:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 21:22:31,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:31,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:22:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 147 states and 171 transitions. [2024-11-13 21:22:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2024-11-13 21:22:31,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 21:22:31,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:31,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:22:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 148 states and 172 transitions. [2024-11-13 21:22:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2024-11-13 21:22:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:22:32,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:32,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:22:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:32,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 147 states and 171 transitions. [2024-11-13 21:22:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2024-11-13 21:22:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:22:32,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:22:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 148 states and 173 transitions. [2024-11-13 21:22:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2024-11-13 21:22:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 21:22:33,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 118 states and 125 transitions. [2024-11-13 21:22:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2024-11-13 21:22:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 21:22:34,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:34,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:22:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 117 states and 124 transitions. [2024-11-13 21:22:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2024-11-13 21:22:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:22:34,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:22:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 116 states and 123 transitions. [2024-11-13 21:22:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2024-11-13 21:22:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:22:41,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:22:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 115 states and 122 transitions. [2024-11-13 21:22:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2024-11-13 21:22:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:22:45,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:45,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:22:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:22:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 114 states and 121 transitions. [2024-11-13 21:22:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2024-11-13 21:22:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:22:52,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:22:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:22:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:22:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:23:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 113 states and 120 transitions. [2024-11-13 21:23:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2024-11-13 21:23:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:23:05,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:23:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 112 states and 119 transitions. [2024-11-13 21:23:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-11-13 21:23:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:23:21,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:21,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:23:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 111 states and 118 transitions. [2024-11-13 21:23:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2024-11-13 21:23:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:23:23,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:23,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:23:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 110 states and 117 transitions. [2024-11-13 21:23:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2024-11-13 21:23:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:23:39,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:39,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:23:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 109 states and 116 transitions. [2024-11-13 21:23:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2024-11-13 21:23:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:23:49,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:49,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:23:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 108 states and 115 transitions. [2024-11-13 21:23:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2024-11-13 21:23:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:23:52,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:23:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 107 states and 114 transitions. [2024-11-13 21:23:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2024-11-13 21:23:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 21:23:56,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:56,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:23:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:23:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 106 states and 113 transitions. [2024-11-13 21:23:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2024-11-13 21:23:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 21:23:59,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:23:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:23:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:23:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:24:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 105 states and 112 transitions. [2024-11-13 21:24:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2024-11-13 21:24:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 21:24:04,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:24:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 104 states and 111 transitions. [2024-11-13 21:24:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2024-11-13 21:24:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 21:24:07,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:24:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 103 states and 110 transitions. [2024-11-13 21:24:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2024-11-13 21:24:10,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 21:24:10,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:24:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 102 states and 109 transitions. [2024-11-13 21:24:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2024-11-13 21:24:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 21:24:15,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:24:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 101 states and 108 transitions. [2024-11-13 21:24:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2024-11-13 21:24:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:24:18,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:18,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:24:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 100 states and 107 transitions. [2024-11-13 21:24:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2024-11-13 21:24:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:24:23,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:24:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 99 states and 106 transitions. [2024-11-13 21:24:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2024-11-13 21:24:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:24:28,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:28,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:24:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 98 states and 105 transitions. [2024-11-13 21:24:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-13 21:24:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:24:33,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:33,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:24:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 97 states and 104 transitions. [2024-11-13 21:24:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-11-13 21:24:37,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:24:37,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:24:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:24:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 96 states and 103 transitions. [2024-11-13 21:24:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-13 21:24:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:24:52,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:24:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:24:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:24:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:25:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 95 states and 102 transitions. [2024-11-13 21:25:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-13 21:25:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:25:08,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:08,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:25:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 94 states and 101 transitions. [2024-11-13 21:25:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-13 21:25:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:25:39,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:39,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:25:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:25:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 93 states and 100 transitions. [2024-11-13 21:25:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-13 21:25:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:25:49,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:25:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:25:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:25:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:26:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 92 states and 99 transitions. [2024-11-13 21:26:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-13 21:26:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:26:00,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:26:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 91 states and 98 transitions. [2024-11-13 21:26:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2024-11-13 21:26:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:26:11,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:26:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 90 states and 97 transitions. [2024-11-13 21:26:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2024-11-13 21:26:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:26:12,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:12,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:26:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 89 states and 96 transitions. [2024-11-13 21:26:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-11-13 21:26:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 21:26:12,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:12,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:26:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 88 states and 95 transitions. [2024-11-13 21:26:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-13 21:26:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 21:26:16,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:16,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:26:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 87 states and 94 transitions. [2024-11-13 21:26:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-13 21:26:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 21:26:16,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:16,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:26:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 86 states and 93 transitions. [2024-11-13 21:26:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-13 21:26:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 21:26:20,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:20,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:26:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 85 states and 92 transitions. [2024-11-13 21:26:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-13 21:26:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 21:26:23,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:23,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:26:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 84 states and 91 transitions. [2024-11-13 21:26:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-13 21:26:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 21:26:27,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:27,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:26:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 83 states and 90 transitions. [2024-11-13 21:26:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-11-13 21:26:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:26:32,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:26:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 82 states and 89 transitions. [2024-11-13 21:26:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-11-13 21:26:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:26:35,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:35,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:26:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 81 states and 88 transitions. [2024-11-13 21:26:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-11-13 21:26:39,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:26:39,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:26:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 80 states and 87 transitions. [2024-11-13 21:26:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-11-13 21:26:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:26:42,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:42,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:26:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 79 states and 86 transitions. [2024-11-13 21:26:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-13 21:26:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:26:46,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:46,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:26:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:26:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:26:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 78 states and 85 transitions. [2024-11-13 21:26:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-13 21:26:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:26:59,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:26:59,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:26:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:27:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 77 states and 84 transitions. [2024-11-13 21:27:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-11-13 21:27:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:27:12,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:12,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:27:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 76 states and 83 transitions. [2024-11-13 21:27:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-13 21:27:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:27:28,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:27:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-11-13 21:27:34,449 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-13 21:27:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:27:34,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:34,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:27:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 74 states and 81 transitions. [2024-11-13 21:27:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-11-13 21:27:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:27:45,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:45,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:27:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:27:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 73 states and 80 transitions. [2024-11-13 21:27:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-13 21:27:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 21:27:50,442 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:27:50,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:27:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:27:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:28:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:28:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 75 states and 86 transitions. [2024-11-13 21:28:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2024-11-13 21:28:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 21:28:46,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:28:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:28:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:28:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:29:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:29:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 75 states and 85 transitions. [2024-11-13 21:29:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-13 21:29:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 21:29:10,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:29:10,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:29:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:29:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:29:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:29:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 75 states and 84 transitions. [2024-11-13 21:29:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-11-13 21:29:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 21:29:37,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:29:37,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:29:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:29:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:29:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:29:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 75 states and 83 transitions. [2024-11-13 21:29:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-13 21:29:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 21:29:44,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:29:44,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:29:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:29:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:29:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:29:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-11-13 21:29:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-13 21:29:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 21:29:58,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:29:58,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:29:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 72 states and 78 transitions. [2024-11-13 21:30:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-13 21:30:42,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:30:42,123 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 75 iterations. [2024-11-13 21:30:42,132 INFO L729 CodeCheckObserver]: All specifications hold 62 specifications checked. All of them hold [2024-11-13 21:30:46,552 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-11-13 21:30:46,553 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-11-13 21:30:46,553 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,553 INFO L77 FloydHoareUtils]: At program point L597(lines 597 615) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-13 21:30:46,554 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-11-13 21:30:46,554 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,554 INFO L77 FloydHoareUtils]: At program point L589(line 589) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-13 21:30:46,554 INFO L77 FloydHoareUtils]: At program point L589-1(line 589) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-13 21:30:46,554 INFO L77 FloydHoareUtils]: At program point L589-2(line 589) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-13 21:30:46,554 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 617 623) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 21:30:46,554 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-11-13 21:30:46,555 INFO L77 FloydHoareUtils]: At program point L581(line 581) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse3 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (store |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse1 (select .cse3 0))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= (select |#valid| .cse0) 1) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= .cse1 0)) (< .cse0 |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) (= (select .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (store (store .cse2 .cse1 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= .cse1 |ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) [2024-11-13 21:30:46,555 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-11-13 21:30:46,555 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-11-13 21:30:46,555 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,555 INFO L77 FloydHoareUtils]: At program point L573(lines 573 575) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) (.cse1 (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse4 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)) (.cse8 (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse9 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (store (store (store |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse3 .cse4 (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) .cse6 .cse7 .cse8 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse9 (not .cse10)) (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 (= (store (store |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)))) [2024-11-13 21:30:46,555 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-11-13 21:30:46,556 INFO L77 FloydHoareUtils]: At program point L573-1(lines 573 575) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) (.cse1 (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse4 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)) (.cse8 (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse9 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (store (store (store |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse3 .cse4 (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) .cse6 .cse7 .cse8 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse9 (not .cse10)) (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 (= (store (store |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)))) [2024-11-13 21:30:46,556 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-11-13 21:30:46,557 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-13 21:30:46,557 INFO L77 FloydHoareUtils]: At program point L565(lines 565 567) the Hoare annotation is: (and (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) [2024-11-13 21:30:46,557 INFO L77 FloydHoareUtils]: At program point L598-1(line 598) the Hoare annotation is: (and (= (store (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-13 21:30:46,557 INFO L77 FloydHoareUtils]: At program point L565-1(lines 565 567) the Hoare annotation is: (and (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) [2024-11-13 21:30:46,557 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,558 INFO L77 FloydHoareUtils]: At program point L598-2(line 598) the Hoare annotation is: (and (= (store (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-13 21:30:46,558 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-11-13 21:30:46,558 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,558 INFO L77 FloydHoareUtils]: At program point L590(lines 590 596) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,558 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-11-13 21:30:46,558 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-11-13 21:30:46,558 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-11-13 21:30:46,559 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-11-13 21:30:46,559 INFO L77 FloydHoareUtils]: At program point L607(line 607) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-13 21:30:46,559 INFO L77 FloydHoareUtils]: At program point L607-1(line 607) the Hoare annotation is: (and (= (store (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-13 21:30:46,559 INFO L77 FloydHoareUtils]: At program point L607-2(line 607) the Hoare annotation is: (and (= (store (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-13 21:30:46,560 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-11-13 21:30:46,560 INFO L77 FloydHoareUtils]: At program point L599(lines 599 605) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-13 21:30:46,560 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-11-13 21:30:46,560 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,560 INFO L77 FloydHoareUtils]: At program point L591(line 591) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,560 INFO L77 FloydHoareUtils]: At program point L591-1(line 591) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,561 INFO L77 FloydHoareUtils]: At program point L591-2(line 591) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,561 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:30:46,561 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-11-13 21:30:46,561 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-11-13 21:30:46,561 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-11-13 21:30:46,561 INFO L77 FloydHoareUtils]: At program point L608(lines 608 614) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,561 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-11-13 21:30:46,561 INFO L77 FloydHoareUtils]: At program point L608-2(lines 585 616) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 21:30:46,562 INFO L77 FloydHoareUtils]: At program point L600(line 600) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-13 21:30:46,562 INFO L77 FloydHoareUtils]: At program point L600-1(line 600) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-13 21:30:46,562 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-11-13 21:30:46,562 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,562 INFO L77 FloydHoareUtils]: At program point L600-2(line 600) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-13 21:30:46,562 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,563 INFO L77 FloydHoareUtils]: At program point L592(line 592) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-13 21:30:46,563 INFO L77 FloydHoareUtils]: At program point L592-1(line 592) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-13 21:30:46,563 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-11-13 21:30:46,563 INFO L77 FloydHoareUtils]: At program point L592-2(line 592) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-13 21:30:46,563 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-11-13 21:30:46,563 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-11-13 21:30:46,563 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,563 INFO L77 FloydHoareUtils]: At program point L609(line 609) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,564 INFO L77 FloydHoareUtils]: At program point L576(line 576) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) (.cse1 (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse4 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)) (.cse8 (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse9 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 (= (store (store |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse9 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (not (= 0 .cse10)) .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (< |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) .cse3 .cse4 (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= (+ .cse10 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse10) .cse5 (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse10)) .cse6 .cse7 .cse8 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse9 (= (store (store (store |#valid| .cse10 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))))) [2024-11-13 21:30:46,564 INFO L77 FloydHoareUtils]: At program point L609-1(line 609) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,564 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-11-13 21:30:46,564 INFO L77 FloydHoareUtils]: At program point L609-2(line 609) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,564 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-11-13 21:30:46,564 INFO L77 FloydHoareUtils]: At program point L601(line 601) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-13 21:30:46,564 INFO L77 FloydHoareUtils]: At program point L568(line 568) the Hoare annotation is: (and (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) [2024-11-13 21:30:46,565 INFO L77 FloydHoareUtils]: At program point L601-1(line 601) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-13 21:30:46,565 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-11-13 21:30:46,565 INFO L77 FloydHoareUtils]: At program point L601-2(line 601) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-13 21:30:46,565 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,565 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-11-13 21:30:46,566 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,566 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-11-13 21:30:46,566 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-11-13 21:30:46,566 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-11-13 21:30:46,566 INFO L77 FloydHoareUtils]: At program point L610(line 610) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,566 INFO L77 FloydHoareUtils]: At program point L610-1(line 610) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,566 INFO L77 FloydHoareUtils]: At program point L610-2(line 610) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,567 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-11-13 21:30:46,567 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-11-13 21:30:46,567 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,567 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-11-13 21:30:46,567 INFO L77 FloydHoareUtils]: At program point L594(line 594) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,567 INFO L77 FloydHoareUtils]: At program point L561(line 561) the Hoare annotation is: true [2024-11-13 21:30:46,567 INFO L77 FloydHoareUtils]: At program point L594-1(line 594) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,568 INFO L77 FloydHoareUtils]: At program point L561-1(line 561) the Hoare annotation is: true [2024-11-13 21:30:46,568 INFO L77 FloydHoareUtils]: At program point L594-2(line 594) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,568 INFO L77 FloydHoareUtils]: At program point L586(line 586) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (.cse4 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (let ((.cse1 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (.cse2 (select .cse6 .cse4)) (.cse0 (select .cse6 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (.cse5 (select .cse6 0))) (and (= (select |#valid| .cse0) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (select .cse1 .cse2) 1) (= (select .cse3 .cse4) 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store .cse1 .cse5 0) (select .cse6 4) 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 8) (= (select .cse3 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0) (< .cse2 |#StackHeapBarrier|) (not (= .cse2 .cse0)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| .cse0)) (not (= .cse5 0))))) [2024-11-13 21:30:46,568 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-11-13 21:30:46,568 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-11-13 21:30:46,568 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-11-13 21:30:46,569 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:30:46,569 INFO L77 FloydHoareUtils]: At program point L603(line 603) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-13 21:30:46,569 INFO L77 FloydHoareUtils]: At program point L603-1(line 603) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-13 21:30:46,569 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK(lines 617 623) no Hoare annotation was computed. [2024-11-13 21:30:46,569 INFO L77 FloydHoareUtils]: At program point L603-2(line 603) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-13 21:30:46,569 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,569 INFO L77 FloydHoareUtils]: At program point L595(line 595) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,570 INFO L77 FloydHoareUtils]: At program point L595-1(line 595) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,570 INFO L77 FloydHoareUtils]: At program point L595-2(line 595) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,570 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-11-13 21:30:46,570 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-11-13 21:30:46,570 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,570 INFO L77 FloydHoareUtils]: At program point L587(line 587) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|))) (let ((.cse0 (select .cse3 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (.cse1 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0)) (.cse2 (select .cse3 0))) (and (= (select |#valid| .cse0) 1) (= (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (<= (+ .cse0 1) |#StackHeapBarrier|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| .cse0)) (= (store (store .cse1 .cse2 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|))))) [2024-11-13 21:30:46,570 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-11-13 21:30:46,570 INFO L77 FloydHoareUtils]: At program point L612(line 612) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,570 INFO L77 FloydHoareUtils]: At program point L612-1(line 612) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,571 INFO L77 FloydHoareUtils]: At program point L612-2(line 612) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,571 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-11-13 21:30:46,571 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-11-13 21:30:46,571 INFO L77 FloydHoareUtils]: At program point L604(line 604) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,571 INFO L77 FloydHoareUtils]: At program point L604-1(line 604) the Hoare annotation is: (and (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,571 INFO L77 FloydHoareUtils]: At program point L604-2(line 604) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,571 INFO L77 FloydHoareUtils]: At program point L571-2(lines 571 580) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse1 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (.cse4 (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse7 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|)) (.cse10 (store |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse11 (not .cse13)) (.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse6 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse8 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse9 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (or (let ((.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse12 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse5 (select .cse12 0))) (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) .cse1 (= (select |#valid| .cse2) 1) (<= (+ 1 .cse2) |#StackHeapBarrier|) (< |ULTIMATE.start_dll_circular_create_~len#1| 2) .cse3 .cse4 (not (= .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= .cse5 0)) .cse6 .cse7 .cse8 .cse9 (= (store (store .cse10 .cse5 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= .cse5 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse11))) (and .cse0 (<= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (< |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse11) (and .cse0 (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse6 .cse8 .cse9 .cse13 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|))))) [2024-11-13 21:30:46,571 INFO L77 FloydHoareUtils]: At program point L571-3(lines 571 580) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (select .cse2 0))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#valid| .cse0) 1) (<= (+ 1 .cse0) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= .cse1 0)) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) (= (store (store (store |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) .cse1 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= .cse1 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) [2024-11-13 21:30:46,572 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,574 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-11-13 21:30:46,574 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:30:46,574 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-11-13 21:30:46,574 INFO L77 FloydHoareUtils]: At program point L588(lines 588 615) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-13 21:30:46,574 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-11-13 21:30:46,574 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-11-13 21:30:46,574 INFO L77 FloydHoareUtils]: At program point L613(line 613) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,575 INFO L77 FloydHoareUtils]: At program point L613-1(line 613) the Hoare annotation is: (and (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,575 INFO L77 FloydHoareUtils]: At program point L613-2(line 613) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-13 21:30:46,589 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:30:46,589 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:30:46,602 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-13 21:30:46,602 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-13 21:30:46,602 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-13 21:30:46,602 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 21:30:46,603 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:30:46,603 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:30:46,603 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:30:46,603 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:30:46,603 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-13 21:30:46,603 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-13 21:30:46,603 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 21:30:46,603 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-13 21:30:46,604 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:30:46,604 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:30:46,608 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:30:46,608 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:30:46,608 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-13 21:30:46,608 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-13 21:30:46,608 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 21:30:46,608 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-13 21:30:46,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-13 21:30:46,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-13 21:30:46,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 21:30:46,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-13 21:30:46,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-13 21:30:46,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 21:30:46,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-13 21:30:46,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-13 21:30:46,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:30:46,610 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:30:46,610 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:30:46,610 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:30:46,610 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-13 21:30:46,610 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-13 21:30:46,610 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 21:30:46,610 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 21:30:46,610 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 21:30:46,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-13 21:30:46,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-13 21:30:46,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:30:46,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:30:46,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:30:46,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:30:46,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:30:46,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:30:46,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-13 21:30:46,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-13 21:30:46,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 21:30:46,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-13 21:30:46,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-13 21:30:46,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:30:46,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:30:46,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 21:30:46,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:30:46,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:30:46,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 21:30:46,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-13 21:30:46,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-13 21:30:46,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:30:46,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:30:46,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:30:46,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:30:46,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-13 21:30:46,614 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-13 21:30:46,614 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-13 21:30:46,614 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:30:46,614 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:30:46,614 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 21:30:46,614 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-13 21:30:46,616 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-13 21:30:46,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-13 21:30:46,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-13 21:30:46,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 21:30:46,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:30:46,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:30:46,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:30:46,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 21:30:46,621 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayStoreExpression[IdentifierExpression[#valid,GLOBAL],[IdentifierExpression[~head~0!base,]],IntegerLiteral[0]] [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-13 21:30:46,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-13 21:30:46,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:30:46 ImpRootNode [2024-11-13 21:30:46,628 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:30:46,629 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:30:46,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:30:46,629 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:30:46,629 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:22:18" (3/4) ... [2024-11-13 21:30:46,632 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:30:46,641 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-13 21:30:46,643 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 21:30:46,643 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 21:30:46,644 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:30:46,747 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:30:46,748 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:30:46,748 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:30:46,749 INFO L158 Benchmark]: Toolchain (without parser) took 509529.40ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 93.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 727.8MB. Max. memory is 16.1GB. [2024-11-13 21:30:46,749 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:30:46,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.82ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 76.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:30:46,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.38ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 74.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:30:46,751 INFO L158 Benchmark]: Boogie Preprocessor took 49.57ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:30:46,752 INFO L158 Benchmark]: RCFGBuilder took 808.54ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 47.8MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 21:30:46,753 INFO L158 Benchmark]: CodeCheck took 507927.16ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 47.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 685.9MB. Max. memory is 16.1GB. [2024-11-13 21:30:46,754 INFO L158 Benchmark]: Witness Printer took 119.69ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:30:46,755 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 129 locations, 62 error locations. Started 1 CEGAR loops. OverallTime: 503.4s, OverallIterations: 75, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23414 SdHoareTripleChecker+Valid, 125.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22579 mSDsluCounter, 17856 SdHoareTripleChecker+Invalid, 111.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16318 mSDsCounter, 13896 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70077 IncrementalHoareTripleChecker+Invalid, 83973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13896 mSolverCounterUnsat, 1538 mSDtfsCounter, 70077 mSolverCounterSat, 2.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13611 GetRequests, 11460 SyntacticMatches, 613 SemanticMatches, 1538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1428217 ImplicationChecksByTransitivity, 482.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 84.2s InterpolantComputationTime, 1562 NumberOfCodeBlocks, 1562 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1488 ConstructedInterpolants, 0 QuantifiedInterpolants, 13363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 74 InterpolantComputations, 38 PerfectInterpolantSequences, 189/386 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 591]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 591]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 591]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 601]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 601]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 601]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 607]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 607]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 607]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 609]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 609]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 609]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 610]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 610]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 610]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 612]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 612]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 612]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 613]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 613]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 613]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 617]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 62 specifications checked. All of them hold - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: (((len < 2) || ((2 <= len) && (len < 3))) || ((len <= 3) && (3 <= len))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.82ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 76.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.38ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 74.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.57ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 808.54ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 47.8MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 507927.16ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 47.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 685.9MB. Max. memory is 16.1GB. * Witness Printer took 119.69ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayStoreExpression[IdentifierExpression[#valid,GLOBAL],[IdentifierExpression[~head~0!base,]],IntegerLiteral[0]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base RESULT: Ultimate proved your program to be correct! [2024-11-13 21:30:46,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c1eb6ba-a44f-4efa-827b-fc82600e0086/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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