./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b --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 64bit --witnessprinter.graph.data.programhash 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 04:40:51,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 04:40:51,710 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-12-06 04:40:51,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 04:40:51,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 04:40:51,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 04:40:51,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 04:40:51,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 04:40:51,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 04:40:51,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 04:40:51,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 04:40:51,734 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-06 04:40:51,734 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-06 04:40:51,734 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-06 04:40:51,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 04:40:51,734 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 04:40:51,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 04:40:51,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 04:40:51,735 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 04:40:51,735 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 04:40:51,735 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 04:40:51,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 04:40:51,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:40:51,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 04:40:51,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 04:40:51,735 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 04:40:51,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 04:40:51,736 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_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b [2024-12-06 04:40:51,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 04:40:51,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 04:40:51,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 04:40:51,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 04:40:51,949 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 04:40:51,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2024-12-06 04:40:54,587 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/data/756698286/5eaa38e0cc984919aec897d465a7413a/FLAGa7c0551b6 [2024-12-06 04:40:54,815 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 04:40:54,815 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2024-12-06 04:40:54,824 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/data/756698286/5eaa38e0cc984919aec897d465a7413a/FLAGa7c0551b6 [2024-12-06 04:40:55,154 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/data/756698286/5eaa38e0cc984919aec897d465a7413a [2024-12-06 04:40:55,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 04:40:55,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 04:40:55,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 04:40:55,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 04:40:55,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 04:40:55,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d4947c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55, skipping insertion in model container [2024-12-06 04:40:55,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 04:40:55,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:40:55,378 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 04:40:55,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:40:55,431 INFO L204 MainTranslator]: Completed translation [2024-12-06 04:40:55,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55 WrapperNode [2024-12-06 04:40:55,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 04:40:55,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 04:40:55,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 04:40:55,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 04:40:55,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,461 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2024-12-06 04:40:55,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 04:40:55,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 04:40:55,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 04:40:55,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 04:40:55,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 04:40:55,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 04:40:55,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 04:40:55,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 04:40:55,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:40:55,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 04:40:55,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 04:40:55,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 04:40:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-06 04:40:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-06 04:40:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-06 04:40:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-06 04:40:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 04:40:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 04:40:55,610 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 04:40:55,611 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 04:40:55,840 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-12-06 04:40:55,840 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 04:40:55,873 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 04:40:55,874 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 04:40:55,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:40:55 BoogieIcfgContainer [2024-12-06 04:40:55,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 04:40:55,875 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 04:40:55,875 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 04:40:55,881 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 04:40:55,881 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:40:55" (1/1) ... [2024-12-06 04:40:55,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 04:40:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 68 states and 75 transitions. [2024-12-06 04:40:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2024-12-06 04:40:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 04:40:55,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 67 states and 74 transitions. [2024-12-06 04:40:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-12-06 04:40:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 04:40:56,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 66 states and 73 transitions. [2024-12-06 04:40:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-12-06 04:40:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 04:40:56,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:56,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 65 states and 72 transitions. [2024-12-06 04:40:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-12-06 04:40:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 04:40:56,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 64 states and 71 transitions. [2024-12-06 04:40:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-12-06 04:40:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 04:40:56,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:56,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 63 states and 70 transitions. [2024-12-06 04:40:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-12-06 04:40:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 04:40:57,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:57,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 62 states and 69 transitions. [2024-12-06 04:40:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-12-06 04:40:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 04:40:57,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:57,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 63 states and 71 transitions. [2024-12-06 04:40:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-12-06 04:40:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 04:40:57,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 64 states and 73 transitions. [2024-12-06 04:40:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-12-06 04:40:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 04:40:58,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 67 states and 79 transitions. [2024-12-06 04:40:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2024-12-06 04:40:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 04:40:58,445 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 70 states and 86 transitions. [2024-12-06 04:40:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2024-12-06 04:40:59,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 04:40:59,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 71 states and 88 transitions. [2024-12-06 04:40:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2024-12-06 04:40:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 04:40:59,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 72 states and 89 transitions. [2024-12-06 04:40:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2024-12-06 04:40:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 04:40:59,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:40:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:40:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 75 states and 95 transitions. [2024-12-06 04:40:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2024-12-06 04:40:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 04:40:59,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:40:59,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:40:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:40:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 80 states and 108 transitions. [2024-12-06 04:41:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2024-12-06 04:41:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:41:00,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:00,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 82 states and 110 transitions. [2024-12-06 04:41:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2024-12-06 04:41:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:41:00,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:00,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 85 states and 115 transitions. [2024-12-06 04:41:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2024-12-06 04:41:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:41:00,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:00,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 88 states and 120 transitions. [2024-12-06 04:41:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-12-06 04:41:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:41:00,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:00,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 93 states and 129 transitions. [2024-12-06 04:41:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-12-06 04:41:00,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:41:00,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 98 states and 138 transitions. [2024-12-06 04:41:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2024-12-06 04:41:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:41:00,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 99 states and 139 transitions. [2024-12-06 04:41:00,850 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2024-12-06 04:41:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:41:00,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:00,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 107 states and 160 transitions. [2024-12-06 04:41:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 160 transitions. [2024-12-06 04:41:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:41:01,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 115 states and 181 transitions. [2024-12-06 04:41:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 181 transitions. [2024-12-06 04:41:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:41:01,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:01,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 119 states and 190 transitions. [2024-12-06 04:41:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 190 transitions. [2024-12-06 04:41:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:41:02,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:02,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 123 states and 202 transitions. [2024-12-06 04:41:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 202 transitions. [2024-12-06 04:41:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:41:02,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:02,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 124 states and 204 transitions. [2024-12-06 04:41:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 204 transitions. [2024-12-06 04:41:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:41:02,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:02,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 125 states and 205 transitions. [2024-12-06 04:41:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 205 transitions. [2024-12-06 04:41:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:41:02,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:02,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 125 states and 204 transitions. [2024-12-06 04:41:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 204 transitions. [2024-12-06 04:41:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:41:02,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:02,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 126 states and 204 transitions. [2024-12-06 04:41:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 204 transitions. [2024-12-06 04:41:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:41:02,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:02,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 128 states and 206 transitions. [2024-12-06 04:41:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 206 transitions. [2024-12-06 04:41:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:41:03,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 130 states and 209 transitions. [2024-12-06 04:41:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 209 transitions. [2024-12-06 04:41:03,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:41:03,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 132 states and 210 transitions. [2024-12-06 04:41:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 210 transitions. [2024-12-06 04:41:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:41:03,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:03,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 134 states and 216 transitions. [2024-12-06 04:41:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 216 transitions. [2024-12-06 04:41:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:41:03,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:03,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 135 states and 218 transitions. [2024-12-06 04:41:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 218 transitions. [2024-12-06 04:41:03,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 04:41:03,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 137 states and 220 transitions. [2024-12-06 04:41:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 220 transitions. [2024-12-06 04:41:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 04:41:03,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:03,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 141 states and 226 transitions. [2024-12-06 04:41:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 226 transitions. [2024-12-06 04:41:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:41:05,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:05,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 143 states and 229 transitions. [2024-12-06 04:41:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 229 transitions. [2024-12-06 04:41:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:41:05,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 145 states and 234 transitions. [2024-12-06 04:41:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 234 transitions. [2024-12-06 04:41:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:41:05,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:05,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 147 states and 237 transitions. [2024-12-06 04:41:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 237 transitions. [2024-12-06 04:41:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:41:06,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:06,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 149 states and 241 transitions. [2024-12-06 04:41:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 241 transitions. [2024-12-06 04:41:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 04:41:06,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:06,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 151 states and 243 transitions. [2024-12-06 04:41:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 243 transitions. [2024-12-06 04:41:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:41:06,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:06,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 154 states and 250 transitions. [2024-12-06 04:41:07,456 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 250 transitions. [2024-12-06 04:41:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:41:07,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 167 states and 279 transitions. [2024-12-06 04:41:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 279 transitions. [2024-12-06 04:41:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:41:11,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:11,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 170 states and 284 transitions. [2024-12-06 04:41:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 284 transitions. [2024-12-06 04:41:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:41:12,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 173 states and 289 transitions. [2024-12-06 04:41:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 289 transitions. [2024-12-06 04:41:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:41:13,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:13,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 175 states and 290 transitions. [2024-12-06 04:41:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 290 transitions. [2024-12-06 04:41:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:41:14,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 179 states and 295 transitions. [2024-12-06 04:41:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 295 transitions. [2024-12-06 04:41:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:41:14,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 184 states and 300 transitions. [2024-12-06 04:41:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 300 transitions. [2024-12-06 04:41:16,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:41:16,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 184 states and 299 transitions. [2024-12-06 04:41:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 299 transitions. [2024-12-06 04:41:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 04:41:16,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 186 states and 301 transitions. [2024-12-06 04:41:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 301 transitions. [2024-12-06 04:41:16,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:41:16,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:16,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 185 states and 300 transitions. [2024-12-06 04:41:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 300 transitions. [2024-12-06 04:41:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:41:16,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:16,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 192 states and 312 transitions. [2024-12-06 04:41:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 312 transitions. [2024-12-06 04:41:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:41:20,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:20,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 197 states and 323 transitions. [2024-12-06 04:41:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 323 transitions. [2024-12-06 04:41:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:41:20,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 199 states and 324 transitions. [2024-12-06 04:41:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 324 transitions. [2024-12-06 04:41:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:41:22,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 200 states and 326 transitions. [2024-12-06 04:41:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 326 transitions. [2024-12-06 04:41:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:41:22,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:22,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 202 states and 327 transitions. [2024-12-06 04:41:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 327 transitions. [2024-12-06 04:41:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:41:23,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:23,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 206 states and 333 transitions. [2024-12-06 04:41:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 333 transitions. [2024-12-06 04:41:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 04:41:24,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 212 states and 339 transitions. [2024-12-06 04:41:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 339 transitions. [2024-12-06 04:41:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 04:41:26,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:26,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 211 states and 338 transitions. [2024-12-06 04:41:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 338 transitions. [2024-12-06 04:41:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 04:41:26,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:26,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 212 states and 340 transitions. [2024-12-06 04:41:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 340 transitions. [2024-12-06 04:41:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 04:41:26,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:26,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 211 states and 338 transitions. [2024-12-06 04:41:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 338 transitions. [2024-12-06 04:41:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 04:41:26,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 213 states and 342 transitions. [2024-12-06 04:41:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 342 transitions. [2024-12-06 04:41:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 04:41:26,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:41:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 215 states and 345 transitions. [2024-12-06 04:41:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 345 transitions. [2024-12-06 04:41:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 04:41:26,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:26,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:41:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 215 states and 344 transitions. [2024-12-06 04:41:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 344 transitions. [2024-12-06 04:41:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 04:41:27,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 216 states and 344 transitions. [2024-12-06 04:41:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 344 transitions. [2024-12-06 04:41:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:41:27,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 215 states and 343 transitions. [2024-12-06 04:41:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 343 transitions. [2024-12-06 04:41:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:41:27,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 216 states and 345 transitions. [2024-12-06 04:41:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 345 transitions. [2024-12-06 04:41:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:41:27,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:41:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 216 states and 344 transitions. [2024-12-06 04:41:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 344 transitions. [2024-12-06 04:41:27,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:41:27,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 04:41:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 218 states and 345 transitions. [2024-12-06 04:41:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 345 transitions. [2024-12-06 04:41:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:41:27,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:27,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:41:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 220 states and 347 transitions. [2024-12-06 04:41:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 347 transitions. [2024-12-06 04:41:27,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:41:27,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 04:41:27,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 222 states and 349 transitions. [2024-12-06 04:41:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 349 transitions. [2024-12-06 04:41:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 04:41:27,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:27,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 04:41:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 224 states and 350 transitions. [2024-12-06 04:41:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 350 transitions. [2024-12-06 04:41:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 04:41:27,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 04:41:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 229 states and 356 transitions. [2024-12-06 04:41:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 356 transitions. [2024-12-06 04:41:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 04:41:28,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:28,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 04:41:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 234 states and 361 transitions. [2024-12-06 04:41:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2024-12-06 04:41:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 04:41:28,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 04:41:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:28,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 236 states and 364 transitions. [2024-12-06 04:41:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 364 transitions. [2024-12-06 04:41:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 04:41:28,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 04:41:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2024-12-06 04:41:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2024-12-06 04:41:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 04:41:28,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 04:41:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 240 states and 367 transitions. [2024-12-06 04:41:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 367 transitions. [2024-12-06 04:41:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 04:41:28,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:28,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 04:41:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 242 states and 368 transitions. [2024-12-06 04:41:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 368 transitions. [2024-12-06 04:41:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 04:41:28,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:28,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 247 states and 375 transitions. [2024-12-06 04:41:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 375 transitions. [2024-12-06 04:41:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 04:41:32,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:32,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:41:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 252 states and 383 transitions. [2024-12-06 04:41:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 383 transitions. [2024-12-06 04:41:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 04:41:39,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 04:41:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:41:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 269 states and 411 transitions. [2024-12-06 04:41:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 411 transitions. [2024-12-06 04:41:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:41:50,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:41:50,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:41:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:41:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:42:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:42:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 290 states and 448 transitions. [2024-12-06 04:42:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 448 transitions. [2024-12-06 04:42:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 04:42:10,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:42:10,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:42:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:42:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:42:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:42:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 312 states and 486 transitions. [2024-12-06 04:42:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 486 transitions. [2024-12-06 04:42:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 04:42:31,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:42:31,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:42:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:42:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:42:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:42:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 324 states and 507 transitions. [2024-12-06 04:42:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 507 transitions. [2024-12-06 04:42:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:42:48,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:42:48,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:42:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:42:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 04:42:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:42:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 328 states and 510 transitions. [2024-12-06 04:42:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 510 transitions. [2024-12-06 04:42:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-12-06 04:42:53,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:42:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:42:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:42:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-12-06 04:43:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:43:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 335 states and 517 transitions. [2024-12-06 04:43:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 517 transitions. [2024-12-06 04:43:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-12-06 04:43:02,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:43:02,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:43:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:43:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 04:43:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:43:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 334 states and 516 transitions. [2024-12-06 04:43:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 516 transitions. [2024-12-06 04:43:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-12-06 04:43:02,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:43:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:43:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:43:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:43:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:43:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 368 states and 578 transitions. [2024-12-06 04:43:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 578 transitions. [2024-12-06 04:43:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-12-06 04:43:52,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:43:52,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:43:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:43:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 04:43:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:43:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 366 states and 575 transitions. [2024-12-06 04:43:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 575 transitions. [2024-12-06 04:43:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-12-06 04:43:54,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:43:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:43:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:43:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 04:43:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:43:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 369 states and 578 transitions. [2024-12-06 04:43:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 578 transitions. [2024-12-06 04:43:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-12-06 04:43:55,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:43:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:43:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:43:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 04:43:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:43:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 204 states and 305 transitions. [2024-12-06 04:43:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 305 transitions. [2024-12-06 04:43:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-06 04:43:57,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:43:57,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:43:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:43:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 04:44:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 211 states and 314 transitions. [2024-12-06 04:44:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 314 transitions. [2024-12-06 04:44:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-06 04:44:07,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:07,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 04:44:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 213 states and 319 transitions. [2024-12-06 04:44:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 319 transitions. [2024-12-06 04:44:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-06 04:44:09,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:44:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 210 states and 307 transitions. [2024-12-06 04:44:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2024-12-06 04:44:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-06 04:44:10,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 04:44:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 227 states and 335 transitions. [2024-12-06 04:44:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 335 transitions. [2024-12-06 04:44:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-06 04:44:37,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:37,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 04:44:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:44:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 227 states and 332 transitions. [2024-12-06 04:44:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 332 transitions. [2024-12-06 04:44:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-06 04:44:42,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:44:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:44:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:44:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:45:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 245 states and 361 transitions. [2024-12-06 04:45:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 361 transitions. [2024-12-06 04:45:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-06 04:45:15,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 04:45:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 252 states and 368 transitions. [2024-12-06 04:45:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2024-12-06 04:45:28,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-06 04:45:28,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:28,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 61 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:45:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:45:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 252 states and 365 transitions. [2024-12-06 04:45:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 365 transitions. [2024-12-06 04:45:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-06 04:45:37,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:45:37,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:45:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:45:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 04:46:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:46:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 100 states and 122 transitions. [2024-12-06 04:46:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2024-12-06 04:46:02,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 04:46:02,430 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 100 iterations. [2024-12-06 04:46:02,439 INFO L726 CodeCheckObserver]: All specifications hold 37 specifications checked. All of them hold [2024-12-06 04:46:23,525 INFO L77 FloydHoareUtils]: At program point L555-11(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not |ULTIMATE.start_test_fun_#t~short12#1|) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-12-06 04:46:23,525 INFO L77 FloydHoareUtils]: At program point L555-12(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-06 04:46:23,525 INFO L77 FloydHoareUtils]: At program point L555-13(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-06 04:46:23,525 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK(lines 567 569) no Hoare annotation was computed. [2024-12-06 04:46:23,525 INFO L77 FloydHoareUtils]: At program point L555-16(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse8 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not |ULTIMATE.start_test_fun_#t~short12#1|) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) 0) .cse4 .cse5 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse7 .cse8 .cse9))) [2024-12-06 04:46:23,526 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,526 INFO L77 FloydHoareUtils]: At program point L555-17(line 555) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse10 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse11 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse16)) (.cse15 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse13 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse8 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not |ULTIMATE.start_test_fun_#t~short13#1|) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse2 .cse3 (< .cse11 2147483647) .cse4 .cse5 .cse12 .cse6 .cse13 .cse14 .cse7 (not .cse15) .cse8 .cse9) (and .cse0 .cse10 .cse2 .cse3 (<= .cse11 2147483645) .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse15 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (<= (+ .cse16 1) 0) .cse4 .cse5 .cse12 .cse6 .cse13 .cse14 .cse7 .cse8 .cse9)))) [2024-12-06 04:46:23,526 INFO L77 FloydHoareUtils]: At program point L555-18(line 555) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse2 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse16)) (.cse13 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 (<= .cse3 2147483646) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not .cse13) .cse14 .cse15) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 (not |ULTIMATE.start_test_fun_#t~short16#1|) .cse9 .cse12 .cse14 .cse15) (and .cse0 .cse2 .cse4 .cse5 (<= .cse3 2147483645) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse4 .cse5 (<= (+ .cse16 1) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15)))) [2024-12-06 04:46:23,526 INFO L77 FloydHoareUtils]: At program point L555-19(line 555) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse2 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse16)) (.cse13 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 (<= .cse3 2147483646) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not .cse13) .cse14 .cse15) (and .cse0 .cse2 .cse4 .cse5 (<= .cse3 2147483645) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse4 .cse5 (<= (+ .cse16 1) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15)))) [2024-12-06 04:46:23,526 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,527 INFO L77 FloydHoareUtils]: At program point L555-20(line 555) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse15 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (= .cse5 |ULTIMATE.start_test_fun_#t~mem14#1|)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse16 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse5)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse17 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse13 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ .cse5 1) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse15 (<= .cse16 2147483646) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not .cse17) .cse13 .cse14) (and .cse0 .cse15 .cse2 .cse3 .cse4 (<= .cse16 2147483645) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse17 .cse13 .cse14)))) [2024-12-06 04:46:23,527 INFO L77 FloydHoareUtils]: At program point L555-23(lines 555 564) the Hoare annotation is: (let ((.cse18 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse15 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse18))) (let ((.cse14 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse4 (< 0 .cse15)) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse16 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse3 (<= (+ .cse18 1) 0)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse12 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 (<= .cse15 2147483645) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse16 .cse14 (<= .cse15 2147483646) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 (not .cse11) .cse12 .cse13) (and .cse16 .cse1 .cse5 .cse6 (not |ULTIMATE.start_test_fun_#t~short16#1|) .cse10 .cse12 .cse13) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 (< 2147483646 .cse15) .cse10 .cse12 .cse13))))) [2024-12-06 04:46:23,527 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,527 INFO L77 FloydHoareUtils]: At program point L555-24(lines 555 564) the Hoare annotation is: (let ((.cse18 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse4 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse18))) (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (<= 1 .cse4)) (.cse12 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse16 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse15 (<= (+ .cse18 1) 0)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 2147483645) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse16 .cse1 (<= .cse4 2147483646) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 (not .cse12) .cse13 .cse14) (and .cse0 .cse16 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 (< 2147483646 .cse4) .cse11 .cse13 .cse14))))) [2024-12-06 04:46:23,527 INFO L77 FloydHoareUtils]: At program point L555-26(lines 555 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-06 04:46:23,528 INFO L77 FloydHoareUtils]: At program point L556(lines 556 563) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse20 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse18 (+ .cse16 .cse20))) (let ((.cse15 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (<= 1 .cse18)) (.cse12 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse17 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse3 (= .cse20 |ULTIMATE.start_test_fun_#t~mem17#1|)) (.cse4 (<= (+ .cse20 1) 0)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse19 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 (<= (+ .cse16 |ULTIMATE.start_test_fun_#t~mem17#1|) 2147483645) .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse17 .cse15 (<= .cse18 2147483646) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 (not .cse12) .cse13 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 (< 2147483646 .cse18) .cse11 .cse13 .cse14))))) [2024-12-06 04:46:23,528 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 567 569) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-06 04:46:23,528 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,528 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,528 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,528 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,528 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,529 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0) 2147483646) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= .cse0 0)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-12-06 04:46:23,529 INFO L77 FloydHoareUtils]: At program point L557-1(line 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0) 2147483646) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= .cse0 0)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= .cse0 |ULTIMATE.start_test_fun_#t~mem18#1|) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-12-06 04:46:23,529 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,529 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,529 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,529 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,529 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,529 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 04:46:23,529 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,529 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,529 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,530 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse17 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse18 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse15 (+ .cse17 .cse18))) (let ((.cse8 (<= 1 .cse17)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (<= .cse18 0)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse16 (<= .cse15 2147483645)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse14 (+ .cse18 1)) (.cse12 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse10 (not .cse11) .cse12 .cse13) (and .cse0 .cse2 .cse3 (<= .cse14 0) .cse4 .cse5 .cse6 .cse7 .cse9 (<= 1 .cse15) .cse10 .cse11 .cse12 .cse13) (and .cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse17 2) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (< 0 .cse14) .cse12 .cse13 (<= 2 .cse17)))))) [2024-12-06 04:46:23,530 INFO L77 FloydHoareUtils]: At program point L559-1(lines 559 562) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse19 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse18 (+ .cse16 .cse19))) (let ((.cse4 (<= .cse18 2147483645)) (.cse17 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse1 (<= .cse19 0)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse13 (+ .cse19 1)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (<= 1 |ULTIMATE.start_test_fun_#t~mem19#1|)) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse12 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse14 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< 0 .cse13) .cse14 .cse15 (<= 2 .cse16)) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse16 2) .cse12 .cse14 .cse15) (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse17 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse11 (not .cse12) .cse14 .cse15) (and .cse0 .cse2 .cse3 (<= .cse13 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 .cse18) .cse11 .cse12 .cse14 .cse15))))) [2024-12-06 04:46:23,530 INFO L77 FloydHoareUtils]: At program point L559-3(lines 555 564) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse13 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse10 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse9 (not .cse10) .cse11 .cse12) (and .cse0 .cse2 .cse3 (<= (+ .cse13 1) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse13) 2147483645) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-12-06 04:46:23,530 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,530 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,530 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,531 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,531 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,531 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (let ((.cse17 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse18 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse15 (+ .cse17 .cse18))) (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (<= .cse18 0)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse16 (<= .cse15 2147483645)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse14 (+ .cse18 1)) (.cse12 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse10 (not .cse11) .cse12 .cse13) (and .cse0 .cse3 .cse4 (<= .cse14 0) .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 .cse15) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse17 2) .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< 0 .cse14) .cse12 .cse13 (<= 2 .cse17)))))) [2024-12-06 04:46:23,531 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (let ((.cse17 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse16 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (= .cse16 |ULTIMATE.start_test_fun_#t~mem20#1|)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (<= .cse17 0)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse19 (<= (+ .cse17 |ULTIMATE.start_test_fun_#t~mem20#1|) 2147483645)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse15 (+ .cse17 1)) (.cse12 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse18 (<= 2 .cse16))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse10 (not .cse11) .cse12 .cse13) (and .cse0 .cse3 .cse4 .cse14 (<= .cse15 0) .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 (+ .cse16 .cse17)) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 (not (and .cse14 .cse18)) .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< 0 .cse15) .cse12 .cse13 .cse18)))) [2024-12-06 04:46:23,531 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,531 INFO L77 FloydHoareUtils]: At program point L552(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-06 04:46:23,532 INFO L77 FloydHoareUtils]: At program point L552-1(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,532 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-06 04:46:23,532 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,532 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,533 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,533 INFO L77 FloydHoareUtils]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse14 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse15 (< .cse14 0))) (let ((.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (or |ULTIMATE.start_test_fun_#t~short8#1| .cse15)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse12 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse10 (not .cse11) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse14) 2147483645) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 (not |ULTIMATE.start_test_fun_#t~short8#1|) .cse11 .cse12 .cse13))))) [2024-12-06 04:46:23,533 INFO L77 FloydHoareUtils]: At program point L555-2(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse10 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse9 (not .cse10) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) 2147483645) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2024-12-06 04:46:23,533 INFO L77 FloydHoareUtils]: At program point L555-3(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem7#1|)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse12 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (<= (+ |ULTIMATE.start_test_fun_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) 2147483645) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse9 .cse10 (not .cse11) .cse12 .cse13))) [2024-12-06 04:46:23,533 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,533 INFO L77 FloydHoareUtils]: At program point L555-6(line 555) the Hoare annotation is: (let ((.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse13 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse14 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse15 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not |ULTIMATE.start_test_fun_#t~short8#1|) .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse3 (< .cse14 2147483647) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not .cse15) .cse11 .cse12) (and .cse0 .cse13 .cse2 .cse3 (<= .cse14 2147483645) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12))) [2024-12-06 04:46:23,534 INFO L77 FloydHoareUtils]: At program point L555-7(line 555) the Hoare annotation is: (let ((.cse2 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse5 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (.cse13 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse11 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse14 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (< .cse5 2147483647) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not .cse13) .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 (<= .cse5 2147483645) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not |ULTIMATE.start_test_fun_#t~short13#1|) .cse12 .cse14 .cse15))) [2024-12-06 04:46:23,534 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 04:46:23,534 INFO L77 FloydHoareUtils]: At program point L555-9(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-06 04:46:23,539 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:46:23,540 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:46:23,541 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:46:23,541 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:46:23,541 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:46:23,541 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:46:23,541 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 04:46:23,541 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:46:23,541 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:46:23,541 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 04:46:23,541 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 04:46:23,542 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:46:23,542 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:46:23,542 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 04:46:23,542 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:46:23,544 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:46:23,544 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:46:23,544 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:46:23,544 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:46:23,544 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 04:46:23,544 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-12-06 04:46:23,544 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:46:23,544 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:46:23,544 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 04:46:23,545 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 04:46:23,546 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 04:46:23,547 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 04:46:23,548 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 04:46:23,549 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 04:46:23,550 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 04:46:23,550 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-12-06 04:46:23,550 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 04:46:23,550 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 04:46:23,550 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 04:46:23,550 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 04:46:23,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 04:46:23 ImpRootNode [2024-12-06 04:46:23,551 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 04:46:23,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 04:46:23,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 04:46:23,552 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 04:46:23,552 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:40:55" (3/4) ... [2024-12-06 04:46:23,554 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 04:46:23,559 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-12-06 04:46:23,559 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-06 04:46:23,559 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 04:46:23,559 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 04:46:23,625 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 04:46:23,625 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 04:46:23,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 04:46:23,626 INFO L158 Benchmark]: Toolchain (without parser) took 328469.46ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 117.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 287.1MB. Max. memory is 16.1GB. [2024-12-06 04:46:23,626 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 82.9MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:46:23,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.69ms. Allocated memory is still 142.6MB. Free memory was 117.9MB in the beginning and 101.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:46:23,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.46ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:46:23,627 INFO L158 Benchmark]: Boogie Preprocessor took 20.42ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:46:23,627 INFO L158 Benchmark]: RCFGBuilder took 391.51ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 76.8MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 04:46:23,628 INFO L158 Benchmark]: CodeCheck took 327676.87ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 76.8MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-12-06 04:46:23,628 INFO L158 Benchmark]: Witness Printer took 73.58ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:46:23,629 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, 68 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 306.5s, OverallIterations: 100, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39280 SdHoareTripleChecker+Valid, 107.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37320 mSDsluCounter, 29762 SdHoareTripleChecker+Invalid, 95.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25797 mSDsCounter, 12318 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81522 IncrementalHoareTripleChecker+Invalid, 93840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12318 mSolverCounterUnsat, 3965 mSDtfsCounter, 81522 mSolverCounterSat, 1.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20409 GetRequests, 18308 SyntacticMatches, 841 SemanticMatches, 1260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828543 ImplicationChecksByTransitivity, 294.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 26.9s InterpolantComputationTime, 2293 NumberOfCodeBlocks, 2293 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 2194 ConstructedInterpolants, 0 QuantifiedInterpolants, 21081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 99 InterpolantComputations, 90 PerfectInterpolantSequences, 849/931 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, ConComCheckerStatistics: 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: -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: -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: 567]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 37 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 82.9MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.69ms. Allocated memory is still 142.6MB. Free memory was 117.9MB in the beginning and 101.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.46ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.42ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 391.51ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 76.8MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 327676.87ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 76.8MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 73.58ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 4.0MB). 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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - 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: #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: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~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: #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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,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: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~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: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] RESULT: Ultimate proved your program to be correct! [2024-12-06 04:46:23,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_defca293-c0a8-4b07-bffb-d0b22a077d29/bin/ukojak-verify-CZk0znPC7b/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