./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/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_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:50:08,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:50:09,026 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-13 22:50:09,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:50:09,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:50:09,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:50:09,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:50:09,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:50:09,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:50:09,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:50:09,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:50:09,073 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 22:50:09,073 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 22:50:09,073 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 22:50:09,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:50:09,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:50:09,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 22:50:09,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:50:09,075 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:50:09,076 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:50:09,076 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:50:09,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:50:09,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:50:09,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:50:09,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:50:09,076 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:50:09,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:50:09,077 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_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b [2024-11-13 22:50:09,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:50:09,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:50:09,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:50:09,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:50:09,432 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:50:09,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i Unable to find full path for "g++" [2024-11-13 22:50:11,291 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:50:11,618 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:50:11,619 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2024-11-13 22:50:11,632 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/data/ac933c01b/83b59e390e7a42d49fd7c8746dcac422/FLAG5e507bda4 [2024-11-13 22:50:11,652 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/data/ac933c01b/83b59e390e7a42d49fd7c8746dcac422 [2024-11-13 22:50:11,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:50:11,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:50:11,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:50:11,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:50:11,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:50:11,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:50:11" (1/1) ... [2024-11-13 22:50:11,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e969b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:11, skipping insertion in model container [2024-11-13 22:50:11,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:50:11" (1/1) ... [2024-11-13 22:50:11,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:50:11,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:50:11,995 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:50:12,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:50:12,058 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:50:12,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12 WrapperNode [2024-11-13 22:50:12,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:50:12,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:50:12,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:50:12,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:50:12,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,104 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2024-11-13 22:50:12,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:50:12,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:50:12,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:50:12,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:50:12,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:50:12,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:50:12,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:50:12,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:50:12,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:50:12,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:50:12,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:50:12,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:50:12,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 22:50:12,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 22:50:12,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 22:50:12,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 22:50:12,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:50:12,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:50:12,349 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:50:12,352 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:50:12,684 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-11-13 22:50:12,684 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:50:12,750 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:50:12,750 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:50:12,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:50:12 BoogieIcfgContainer [2024-11-13 22:50:12,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:50:12,752 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:50:12,752 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:50:12,768 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:50:12,768 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:50:12" (1/1) ... [2024-11-13 22:50:12,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:50:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 68 states and 75 transitions. [2024-11-13 22:50:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2024-11-13 22:50:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 22:50:12,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 67 states and 74 transitions. [2024-11-13 22:50:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-11-13 22:50:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 22:50:13,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 66 states and 73 transitions. [2024-11-13 22:50:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-13 22:50:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 22:50:13,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 65 states and 72 transitions. [2024-11-13 22:50:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-11-13 22:50:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 22:50:13,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 64 states and 71 transitions. [2024-11-13 22:50:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-11-13 22:50:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 22:50:14,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 63 states and 70 transitions. [2024-11-13 22:50:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-11-13 22:50:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 22:50:14,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 62 states and 69 transitions. [2024-11-13 22:50:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-11-13 22:50:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 22:50:15,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:15,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 63 states and 71 transitions. [2024-11-13 22:50:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-13 22:50:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 22:50:16,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 64 states and 73 transitions. [2024-11-13 22:50:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-11-13 22:50:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 22:50:16,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 67 states and 79 transitions. [2024-11-13 22:50:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2024-11-13 22:50:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 22:50:16,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:16,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 70 states and 86 transitions. [2024-11-13 22:50:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2024-11-13 22:50:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 22:50:17,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 71 states and 88 transitions. [2024-11-13 22:50:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2024-11-13 22:50:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 22:50:18,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 72 states and 89 transitions. [2024-11-13 22:50:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2024-11-13 22:50:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 22:50:18,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 75 states and 95 transitions. [2024-11-13 22:50:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2024-11-13 22:50:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 22:50:18,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:18,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 80 states and 108 transitions. [2024-11-13 22:50:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2024-11-13 22:50:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 22:50:19,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 82 states and 110 transitions. [2024-11-13 22:50:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2024-11-13 22:50:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 22:50:19,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 85 states and 115 transitions. [2024-11-13 22:50:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2024-11-13 22:50:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 22:50:19,788 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:19,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 88 states and 120 transitions. [2024-11-13 22:50:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-11-13 22:50:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 22:50:19,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:19,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 93 states and 129 transitions. [2024-11-13 22:50:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-11-13 22:50:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 22:50:20,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 98 states and 138 transitions. [2024-11-13 22:50:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2024-11-13 22:50:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:50:20,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 106 states and 161 transitions. [2024-11-13 22:50:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 161 transitions. [2024-11-13 22:50:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:50:20,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:20,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 114 states and 182 transitions. [2024-11-13 22:50:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 182 transitions. [2024-11-13 22:50:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:50:21,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:21,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 115 states and 183 transitions. [2024-11-13 22:50:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 183 transitions. [2024-11-13 22:50:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:50:21,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:21,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 119 states and 192 transitions. [2024-11-13 22:50:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 192 transitions. [2024-11-13 22:50:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:50:21,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:21,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 123 states and 204 transitions. [2024-11-13 22:50:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 204 transitions. [2024-11-13 22:50:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:50:22,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:22,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 124 states and 206 transitions. [2024-11-13 22:50:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 206 transitions. [2024-11-13 22:50:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 22:50:22,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:22,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 125 states and 207 transitions. [2024-11-13 22:50:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 207 transitions. [2024-11-13 22:50:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 22:50:22,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 126 states and 208 transitions. [2024-11-13 22:50:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 208 transitions. [2024-11-13 22:50:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 22:50:22,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:22,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 126 states and 207 transitions. [2024-11-13 22:50:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 207 transitions. [2024-11-13 22:50:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 22:50:22,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:22,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 128 states and 209 transitions. [2024-11-13 22:50:23,586 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 209 transitions. [2024-11-13 22:50:23,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 22:50:23,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:23,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 130 states and 210 transitions. [2024-11-13 22:50:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 210 transitions. [2024-11-13 22:50:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 22:50:23,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:23,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 132 states and 211 transitions. [2024-11-13 22:50:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 211 transitions. [2024-11-13 22:50:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 22:50:23,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 134 states and 217 transitions. [2024-11-13 22:50:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 217 transitions. [2024-11-13 22:50:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 22:50:23,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 135 states and 219 transitions. [2024-11-13 22:50:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 219 transitions. [2024-11-13 22:50:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 22:50:23,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 137 states and 221 transitions. [2024-11-13 22:50:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 221 transitions. [2024-11-13 22:50:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 22:50:24,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:24,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 141 states and 227 transitions. [2024-11-13 22:50:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 227 transitions. [2024-11-13 22:50:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:50:26,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:26,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 143 states and 229 transitions. [2024-11-13 22:50:26,602 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 229 transitions. [2024-11-13 22:50:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:50:26,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 145 states and 234 transitions. [2024-11-13 22:50:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 234 transitions. [2024-11-13 22:50:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:50:27,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:27,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 147 states and 236 transitions. [2024-11-13 22:50:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 236 transitions. [2024-11-13 22:50:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:50:27,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 149 states and 240 transitions. [2024-11-13 22:50:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 240 transitions. [2024-11-13 22:50:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 22:50:28,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 151 states and 242 transitions. [2024-11-13 22:50:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 242 transitions. [2024-11-13 22:50:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:28,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:28,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 154 states and 248 transitions. [2024-11-13 22:50:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 248 transitions. [2024-11-13 22:50:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:29,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:29,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 167 states and 277 transitions. [2024-11-13 22:50:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 277 transitions. [2024-11-13 22:50:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:34,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:34,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 169 states and 278 transitions. [2024-11-13 22:50:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 278 transitions. [2024-11-13 22:50:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:35,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:35,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 172 states and 285 transitions. [2024-11-13 22:50:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 285 transitions. [2024-11-13 22:50:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:36,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 175 states and 290 transitions. [2024-11-13 22:50:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 290 transitions. [2024-11-13 22:50:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:38,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:38,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 179 states and 296 transitions. [2024-11-13 22:50:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 296 transitions. [2024-11-13 22:50:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:39,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 181 states and 303 transitions. [2024-11-13 22:50:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 303 transitions. [2024-11-13 22:50:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:40,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 185 states and 307 transitions. [2024-11-13 22:50:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 307 transitions. [2024-11-13 22:50:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:41,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:41,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 186 states and 309 transitions. [2024-11-13 22:50:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 309 transitions. [2024-11-13 22:50:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:42,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 187 states and 309 transitions. [2024-11-13 22:50:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 309 transitions. [2024-11-13 22:50:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 22:50:42,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:42,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 187 states and 308 transitions. [2024-11-13 22:50:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 308 transitions. [2024-11-13 22:50:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:50:43,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 186 states and 307 transitions. [2024-11-13 22:50:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 307 transitions. [2024-11-13 22:50:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:50:43,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 193 states and 319 transitions. [2024-11-13 22:50:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 319 transitions. [2024-11-13 22:50:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:50:47,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 198 states and 330 transitions. [2024-11-13 22:50:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 330 transitions. [2024-11-13 22:50:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:50:48,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:48,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 200 states and 331 transitions. [2024-11-13 22:50:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 331 transitions. [2024-11-13 22:50:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:50:50,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 203 states and 338 transitions. [2024-11-13 22:50:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 338 transitions. [2024-11-13 22:50:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:50:50,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:50,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 205 states and 339 transitions. [2024-11-13 22:50:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 339 transitions. [2024-11-13 22:50:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:50:52,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:52,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 209 states and 347 transitions. [2024-11-13 22:50:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 347 transitions. [2024-11-13 22:50:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 22:50:52,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:52,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:53,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-11-13 22:50:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 215 states and 354 transitions. [2024-11-13 22:50:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 354 transitions. [2024-11-13 22:50:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 22:50:58,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 214 states and 353 transitions. [2024-11-13 22:50:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 353 transitions. [2024-11-13 22:50:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 22:50:58,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 215 states and 355 transitions. [2024-11-13 22:50:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 355 transitions. [2024-11-13 22:50:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 22:50:58,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 214 states and 353 transitions. [2024-11-13 22:50:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 353 transitions. [2024-11-13 22:50:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 22:50:58,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:58,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 216 states and 357 transitions. [2024-11-13 22:50:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2024-11-13 22:50:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 22:50:58,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 22:50:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 216 states and 356 transitions. [2024-11-13 22:50:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 356 transitions. [2024-11-13 22:50:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 22:50:58,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:58,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 22:50:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 218 states and 358 transitions. [2024-11-13 22:50:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 358 transitions. [2024-11-13 22:50:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 22:50:58,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:58,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:58,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-11-13 22:50:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 219 states and 359 transitions. [2024-11-13 22:50:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 359 transitions. [2024-11-13 22:50:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 22:50:59,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 218 states and 358 transitions. [2024-11-13 22:50:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 358 transitions. [2024-11-13 22:50:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 22:50:59,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:59,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:50:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:50:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:50:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 219 states and 360 transitions. [2024-11-13 22:50:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 360 transitions. [2024-11-13 22:50:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 22:50:59,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:50:59,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:50:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:51:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 221 states and 361 transitions. [2024-11-13 22:51:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 361 transitions. [2024-11-13 22:51:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 22:51:00,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 22:51:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 223 states and 362 transitions. [2024-11-13 22:51:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 362 transitions. [2024-11-13 22:51:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 22:51:00,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 22:51:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 225 states and 365 transitions. [2024-11-13 22:51:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 365 transitions. [2024-11-13 22:51:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 22:51:00,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 22:51:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 225 states and 364 transitions. [2024-11-13 22:51:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 364 transitions. [2024-11-13 22:51:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 22:51:01,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 22:51:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 227 states and 365 transitions. [2024-11-13 22:51:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 365 transitions. [2024-11-13 22:51:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 22:51:01,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:01,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 22:51:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 231 states and 369 transitions. [2024-11-13 22:51:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 369 transitions. [2024-11-13 22:51:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 22:51:01,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:01,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 22:51:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 235 states and 373 transitions. [2024-11-13 22:51:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 373 transitions. [2024-11-13 22:51:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 22:51:01,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:01,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 22:51:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 237 states and 375 transitions. [2024-11-13 22:51:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 375 transitions. [2024-11-13 22:51:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 22:51:01,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 22:51:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 239 states and 377 transitions. [2024-11-13 22:51:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 377 transitions. [2024-11-13 22:51:01,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 22:51:01,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:01,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 22:51:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 241 states and 378 transitions. [2024-11-13 22:51:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 378 transitions. [2024-11-13 22:51:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 22:51:01,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:01,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 22:51:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 243 states and 379 transitions. [2024-11-13 22:51:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 379 transitions. [2024-11-13 22:51:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 22:51:01,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:51:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 248 states and 387 transitions. [2024-11-13 22:51:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 387 transitions. [2024-11-13 22:51:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 22:51:05,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:05,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:51:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 253 states and 395 transitions. [2024-11-13 22:51:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 395 transitions. [2024-11-13 22:51:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 22:51:14,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:51:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:51:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:51:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 22:51:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:51:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 45 states and 52 transitions. [2024-11-13 22:51:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-11-13 22:51:19,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 22:51:19,728 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 83 iterations. [2024-11-13 22:51:19,741 INFO L729 CodeCheckObserver]: All specifications hold 37 specifications checked. All of them hold [2024-11-13 22:51:22,880 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 (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not |ULTIMATE.start_test_fun_#t~short12#1|) .cse11 .cse12))) [2024-11-13 22:51:22,881 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|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 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-11-13 22:51:22,881 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|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 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-11-13 22:51:22,882 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK(lines 567 569) no Hoare annotation was computed. [2024-11-13 22:51:22,882 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 (= |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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not |ULTIMATE.start_test_fun_#t~short12#1|) .cse8 .cse9))) [2024-11-13 22:51:22,882 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,882 INFO L77 FloydHoareUtils]: At program point L555-17(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 (not |ULTIMATE.start_test_fun_#t~short13#1|) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .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-11-13 22:51:22,883 INFO L77 FloydHoareUtils]: At program point L555-18(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 (= |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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not |ULTIMATE.start_test_fun_#t~short16#1|) .cse6 .cse7 .cse8 .cse9))) [2024-11-13 22:51:22,883 INFO L77 FloydHoareUtils]: At program point L555-19(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-11-13 22:51:22,883 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,884 INFO L77 FloydHoareUtils]: At program point L555-20(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) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem14#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-11-13 22:51:22,884 INFO L77 FloydHoareUtils]: At program point L555-23(lines 555 564) the Hoare annotation is: (let ((.cse0 (= (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 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse5 (= (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|)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (not |ULTIMATE.start_test_fun_#t~short16#1|) .cse4 .cse5 .cse6) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) .cse0 .cse1 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (< 0 (+ (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|))) .cse2 .cse3 (= |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|)) .cse4 .cse5 .cse6))) [2024-11-13 22:51:22,884 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,884 INFO L77 FloydHoareUtils]: At program point L555-25(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-11-13 22:51:22,885 INFO L77 FloydHoareUtils]: At program point L556(line 556) 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|)) (<= 1 (+ (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|))) (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-11-13 22:51:22,885 INFO L77 FloydHoareUtils]: At program point L556-1(lines 556 563) 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_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 |ULTIMATE.start_test_fun_#t~mem17#1|) (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|)) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0)) (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-11-13 22:51:22,885 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 567 569) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 22:51:22,886 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,886 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,886 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,886 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,886 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,886 INFO L77 FloydHoareUtils]: At program point L557(line 557) 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|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 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-11-13 22:51:22,887 INFO L77 FloydHoareUtils]: At program point L557-1(line 557) 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|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 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-11-13 22:51:22,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,887 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 22:51:22,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,888 INFO L77 FloydHoareUtils]: At program point L559(line 559) 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|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= (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-11-13 22:51:22,888 INFO L77 FloydHoareUtils]: At program point L559-1(lines 559 562) 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|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem19#1|) (= (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-11-13 22:51:22,888 INFO L77 FloydHoareUtils]: At program point L559-3(lines 555 564) 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-11-13 22:51:22,888 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,888 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,889 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,889 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,889 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,889 INFO L77 FloydHoareUtils]: At program point L560(line 560) 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-11-13 22:51:22,890 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) 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-11-13 22:51:22,890 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,890 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_#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|)) (= (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-11-13 22:51:22,890 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_#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|)) (= (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-11-13 22:51:22,891 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,891 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,891 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,891 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,891 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,891 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_#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-11-13 22:51:22,892 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 22:51:22,892 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,892 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,892 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,892 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,892 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,892 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,893 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,893 INFO L77 FloydHoareUtils]: At program point L555-1(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) (or |ULTIMATE.start_test_fun_#t~short8#1| (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (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-11-13 22:51:22,893 INFO L77 FloydHoareUtils]: At program point L555-2(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-11-13 22:51:22,893 INFO L77 FloydHoareUtils]: At program point L555-3(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|)) (= (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|) (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-11-13 22:51:22,893 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,894 INFO L77 FloydHoareUtils]: At program point L555-6(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-11-13 22:51:22,894 INFO L77 FloydHoareUtils]: At program point L555-7(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-11-13 22:51:22,894 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 22:51:22,894 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-11-13 22:51:22,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 22:51:22,906 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 22:51:22,908 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 22:51:22,909 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 22:51:22,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 22:51:22,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 22:51:22,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 22:51:22,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 22:51:22,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-13 22:51:22,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 22:51:22,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 22:51:22,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-13 22:51:22,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-13 22:51:22,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 22:51:22,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 22:51:22,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 22:51:22,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 22:51:22,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 22:51:22,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 22:51:22,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 22:51:22,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 22:51:22,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 22:51:22,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 22:51:22,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 22:51:22,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 22:51:22,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 22:51:22,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 22:51:22,916 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 22:51:22,916 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 22:51:22,916 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 22:51:22,916 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 22:51:22,916 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-13 22:51:22,916 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 22:51:22,916 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 22:51:22,916 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 22:51:22,916 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 22:51:22,917 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 22:51:22,917 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 22:51:22,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:51:22 ImpRootNode [2024-11-13 22:51:22,919 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:51:22,919 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:51:22,919 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:51:22,920 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:51:22,920 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:50:12" (3/4) ... [2024-11-13 22:51:22,923 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 22:51:22,930 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-13 22:51:22,930 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 22:51:22,931 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 22:51:22,931 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 22:51:23,017 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:51:23,017 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 22:51:23,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:51:23,018 INFO L158 Benchmark]: Toolchain (without parser) took 71362.62ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 93.3MB in the beginning and 596.5MB in the end (delta: -503.2MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2024-11-13 22:51:23,019 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:51:23,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.55ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 76.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 22:51:23,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 75.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:51:23,020 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 74.2MB in the end (delta: 723.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:51:23,020 INFO L158 Benchmark]: RCFGBuilder took 607.36ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 52.4MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 22:51:23,020 INFO L158 Benchmark]: CodeCheck took 70167.08ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 52.4MB in the beginning and 604.6MB in the end (delta: -552.2MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2024-11-13 22:51:23,021 INFO L158 Benchmark]: Witness Printer took 98.25ms. Allocated memory is still 755.0MB. Free memory was 604.6MB in the beginning and 596.5MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:51:23,023 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: 66.9s, OverallIterations: 83, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24065 SdHoareTripleChecker+Valid, 84.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22502 mSDsluCounter, 23614 SdHoareTripleChecker+Invalid, 74.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20057 mSDsCounter, 7612 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45423 IncrementalHoareTripleChecker+Invalid, 53035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7612 mSolverCounterUnsat, 3557 mSDtfsCounter, 45423 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11582 GetRequests, 10604 SyntacticMatches, 464 SemanticMatches, 514 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136950 ImplicationChecksByTransitivity, 57.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1309 NumberOfCodeBlocks, 1309 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 1227 ConstructedInterpolants, 0 QuantifiedInterpolants, 10824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 82 InterpolantComputations, 82 PerfectInterpolantSequences, 89/89 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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 1.06ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.55ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 76.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 75.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 74.2MB in the end (delta: 723.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 607.36ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 52.4MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 70167.08ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 52.4MB in the beginning and 604.6MB in the end (delta: -552.2MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. * Witness Printer took 98.25ms. Allocated memory is still 755.0MB. Free memory was 604.6MB in the beginning and 596.5MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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: #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: 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: #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] RESULT: Ultimate proved your program to be correct! [2024-11-13 22:51:23,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_408c9952-5b03-4dc9-8d29-2478ad801e44/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE