./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3 --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 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:34:51,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:34:51,231 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-25 03:34:51,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:34:51,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:34:51,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:34:51,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:34:51,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:34:51,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:34:51,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:34:51,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:34:51,277 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-25 03:34:51,277 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-25 03:34:51,277 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-25 03:34:51,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:34:51,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-25 03:34:51,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:34:51,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:34:51,278 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:34:51,278 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:34:51,278 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:34:51,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:34:51,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:34:51,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:34:51,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:34:51,279 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:34:51,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:34:51,279 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_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3 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 -> 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff [2024-11-25 03:34:51,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:34:51,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:34:51,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:34:51,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:34:51,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:34:51,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2024-11-25 03:34:54,599 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/data/e64cd5ffe/1388ef6ccf034ec4a0abe792d0362010/FLAGdd6e30486 [2024-11-25 03:34:54,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:34:54,960 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2024-11-25 03:34:54,975 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/data/e64cd5ffe/1388ef6ccf034ec4a0abe792d0362010/FLAGdd6e30486 [2024-11-25 03:34:54,993 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/data/e64cd5ffe/1388ef6ccf034ec4a0abe792d0362010 [2024-11-25 03:34:54,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:34:54,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:34:55,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:34:55,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:34:55,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:34:55,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:34:54" (1/1) ... [2024-11-25 03:34:55,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23bc6c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55, skipping insertion in model container [2024-11-25 03:34:55,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:34:54" (1/1) ... [2024-11-25 03:34:55,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:34:55,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:34:55,496 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:34:55,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:34:55,576 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:34:55,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55 WrapperNode [2024-11-25 03:34:55,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:34:55,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:34:55,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:34:55,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:34:55,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,615 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-11-25 03:34:55,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:34:55,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:34:55,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:34:55,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:34:55,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:34:55,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:34:55,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:34:55,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:34:55,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:34:55" (1/1) ... [2024-11-25 03:34:55,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:34:55,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:34:55,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:34:55,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:34:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-25 03:34:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-25 03:34:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-25 03:34:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-25 03:34:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:34:55,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:34:55,839 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:34:55,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:34:56,232 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-25 03:34:56,232 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:34:56,332 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:34:56,332 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-25 03:34:56,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:34:56 BoogieIcfgContainer [2024-11-25 03:34:56,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:34:56,338 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:34:56,338 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:34:56,351 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:34:56,351 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:34:56" (1/1) ... [2024-11-25 03:34:56,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:34:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 60 states and 69 transitions. [2024-11-25 03:34:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-25 03:34:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-25 03:34:56,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:56,747 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-25 03:34:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 59 states and 68 transitions. [2024-11-25 03:34:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-11-25 03:34:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-25 03:34:56,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:56,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:57,084 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-25 03:34:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 58 states and 67 transitions. [2024-11-25 03:34:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-11-25 03:34:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 03:34:57,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:57,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:57,363 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-25 03:34:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 57 states and 66 transitions. [2024-11-25 03:34:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-25 03:34:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 03:34:57,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:57,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-25 03:34:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 56 states and 65 transitions. [2024-11-25 03:34:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-25 03:34:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 03:34:57,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:57,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:58,047 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-25 03:34:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 57 states and 65 transitions. [2024-11-25 03:34:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2024-11-25 03:34:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 03:34:58,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:58,327 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-25 03:34:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 58 states and 68 transitions. [2024-11-25 03:34:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-11-25 03:34:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 03:34:58,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:58,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:58,496 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-25 03:34:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 61 states and 75 transitions. [2024-11-25 03:34:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2024-11-25 03:34:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 03:34:58,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:58,691 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-25 03:34:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 64 states and 82 transitions. [2024-11-25 03:34:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-11-25 03:34:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 03:34:59,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:59,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:59,204 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-25 03:34:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 65 states and 84 transitions. [2024-11-25 03:34:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2024-11-25 03:34:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 03:34:59,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:59,310 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-25 03:34:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 67 states and 90 transitions. [2024-11-25 03:34:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2024-11-25 03:34:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 03:34:59,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:59,721 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-25 03:35:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 70 states and 98 transitions. [2024-11-25 03:35:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2024-11-25 03:35:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 03:35:00,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:00,076 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-25 03:35:00,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 71 states and 100 transitions. [2024-11-25 03:35:00,282 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-11-25 03:35:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 03:35:00,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:00,317 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-25 03:35:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 73 states and 103 transitions. [2024-11-25 03:35:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2024-11-25 03:35:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 03:35:00,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:00,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:00,623 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-25 03:35:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 75 states and 106 transitions. [2024-11-25 03:35:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 106 transitions. [2024-11-25 03:35:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 03:35:00,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:00,851 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-25 03:35:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 76 states and 108 transitions. [2024-11-25 03:35:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2024-11-25 03:35:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 03:35:01,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:01,125 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-25 03:35:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 79 states and 112 transitions. [2024-11-25 03:35:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2024-11-25 03:35:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 03:35:01,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:01,419 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-25 03:35:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 83 states and 118 transitions. [2024-11-25 03:35:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2024-11-25 03:35:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 03:35:01,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:01,672 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-25 03:35:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 87 states and 124 transitions. [2024-11-25 03:35:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2024-11-25 03:35:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 03:35:01,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:01,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:01,942 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-25 03:35:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 89 states and 131 transitions. [2024-11-25 03:35:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2024-11-25 03:35:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 03:35:01,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:01,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:02,032 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-25 03:35:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 92 states and 140 transitions. [2024-11-25 03:35:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 140 transitions. [2024-11-25 03:35:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:02,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:02,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:02,114 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-25 03:35:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 91 states and 139 transitions. [2024-11-25 03:35:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2024-11-25 03:35:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:02,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:02,192 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-25 03:35:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 93 states and 143 transitions. [2024-11-25 03:35:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2024-11-25 03:35:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:02,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:02,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:02,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-25 03:35:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 94 states and 145 transitions. [2024-11-25 03:35:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 145 transitions. [2024-11-25 03:35:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:02,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:02,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:02,314 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-25 03:35:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 97 states and 151 transitions. [2024-11-25 03:35:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 151 transitions. [2024-11-25 03:35:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:02,354 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:02,377 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-25 03:35:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 97 states and 150 transitions. [2024-11-25 03:35:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2024-11-25 03:35:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:02,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:02,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-25 03:35:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 98 states and 150 transitions. [2024-11-25 03:35:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 150 transitions. [2024-11-25 03:35:02,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:02,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:02,566 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-25 03:35:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 99 states and 152 transitions. [2024-11-25 03:35:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 152 transitions. [2024-11-25 03:35:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:02,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:02,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:35:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 102 states and 156 transitions. [2024-11-25 03:35:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2024-11-25 03:35:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:03,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:03,129 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-25 03:35:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 105 states and 160 transitions. [2024-11-25 03:35:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 160 transitions. [2024-11-25 03:35:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 03:35:03,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:03,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:03,700 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-25 03:35:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 114 states and 180 transitions. [2024-11-25 03:35:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 180 transitions. [2024-11-25 03:35:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:35:05,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:05,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:05,227 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-25 03:35:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 113 states and 178 transitions. [2024-11-25 03:35:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2024-11-25 03:35:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:35:05,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:05,475 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-25 03:35:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 117 states and 186 transitions. [2024-11-25 03:35:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 186 transitions. [2024-11-25 03:35:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:35:07,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:07,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:07,772 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-25 03:35:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 119 states and 190 transitions. [2024-11-25 03:35:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 190 transitions. [2024-11-25 03:35:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:35:07,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:07,824 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-25 03:35:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 121 states and 193 transitions. [2024-11-25 03:35:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 193 transitions. [2024-11-25 03:35:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:35:07,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:07,890 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-25 03:35:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 123 states and 196 transitions. [2024-11-25 03:35:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 196 transitions. [2024-11-25 03:35:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:35:07,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:07,942 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-25 03:35:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 122 states and 194 transitions. [2024-11-25 03:35:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2024-11-25 03:35:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:35:07,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:08,004 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-25 03:35:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 124 states and 196 transitions. [2024-11-25 03:35:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 196 transitions. [2024-11-25 03:35:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:35:08,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:08,189 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-25 03:35:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 127 states and 200 transitions. [2024-11-25 03:35:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 200 transitions. [2024-11-25 03:35:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:35:08,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:08,847 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-25 03:35:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 128 states and 201 transitions. [2024-11-25 03:35:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 201 transitions. [2024-11-25 03:35:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:35:09,095 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:09,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:09,126 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-25 03:35:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 127 states and 200 transitions. [2024-11-25 03:35:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 200 transitions. [2024-11-25 03:35:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:35:09,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:09,196 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-25 03:35:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 128 states and 200 transitions. [2024-11-25 03:35:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 200 transitions. [2024-11-25 03:35:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:35:09,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:09,255 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-25 03:35:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 127 states and 199 transitions. [2024-11-25 03:35:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 199 transitions. [2024-11-25 03:35:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:35:09,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:09,318 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-25 03:35:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 128 states and 199 transitions. [2024-11-25 03:35:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2024-11-25 03:35:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 03:35:09,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:09,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:35:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:09,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 130 states and 203 transitions. [2024-11-25 03:35:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 203 transitions. [2024-11-25 03:35:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 03:35:09,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:09,830 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-25 03:35:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 132 states and 206 transitions. [2024-11-25 03:35:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 206 transitions. [2024-11-25 03:35:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 03:35:09,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:10,021 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-25 03:35:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 130 states and 202 transitions. [2024-11-25 03:35:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 202 transitions. [2024-11-25 03:35:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 03:35:10,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:10,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:10,092 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-25 03:35:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 132 states and 203 transitions. [2024-11-25 03:35:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2024-11-25 03:35:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 03:35:10,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:10,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-25 03:35:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 84 states and 126 transitions. [2024-11-25 03:35:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-25 03:35:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 03:35:10,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:10,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-25 03:35:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 47 states and 64 transitions. [2024-11-25 03:35:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2024-11-25 03:35:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 03:35:10,281 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:35:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 55 states and 76 transitions. [2024-11-25 03:35:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2024-11-25 03:35:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 03:35:11,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:11,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:35:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 57 states and 80 transitions. [2024-11-25 03:35:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2024-11-25 03:35:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 03:35:11,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:11,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:35:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 62 states and 89 transitions. [2024-11-25 03:35:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-25 03:35:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 03:35:13,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:13,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:35:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 64 states and 93 transitions. [2024-11-25 03:35:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-25 03:35:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 03:35:14,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:14,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:35:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 65 states and 93 transitions. [2024-11-25 03:35:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-25 03:35:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 03:35:14,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:14,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:35:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 75 states and 111 transitions. [2024-11-25 03:35:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-11-25 03:35:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 03:35:18,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:35:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 79 states and 117 transitions. [2024-11-25 03:35:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 117 transitions. [2024-11-25 03:35:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 03:35:23,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:35:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 78 states and 113 transitions. [2024-11-25 03:35:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2024-11-25 03:35:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 03:35:23,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:35:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 89 states and 134 transitions. [2024-11-25 03:35:31,527 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 134 transitions. [2024-11-25 03:35:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 03:35:31,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:35:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 99 states and 147 transitions. [2024-11-25 03:35:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2024-11-25 03:35:35,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 03:35:35,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 03:35:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 99 states and 145 transitions. [2024-11-25 03:35:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-11-25 03:35:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 03:35:37,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:37,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 03:35:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 99 states and 144 transitions. [2024-11-25 03:35:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-25 03:35:38,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 03:35:38,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 03:35:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 107 states and 154 transitions. [2024-11-25 03:35:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-11-25 03:35:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 03:35:44,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:44,849 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-25 03:35:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 117 states and 169 transitions. [2024-11-25 03:35:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-11-25 03:35:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 03:35:51,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:51,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:51,613 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-25 03:35:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 119 states and 170 transitions. [2024-11-25 03:35:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2024-11-25 03:35:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 03:35:53,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-25 03:35:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 119 states and 168 transitions. [2024-11-25 03:35:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2024-11-25 03:35:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-25 03:35:55,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-25 03:35:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 41 states and 51 transitions. [2024-11-25 03:35:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-11-25 03:35:56,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 03:35:56,909 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 67 iterations. [2024-11-25 03:35:56,920 INFO L726 CodeCheckObserver]: All specifications hold 33 specifications checked. All of them hold [2024-11-25 03:36:00,589 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,590 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,590 INFO L77 FloydHoareUtils]: At program point L564-1(line 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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|))) [2024-11-25 03:36:00,590 INFO L77 FloydHoareUtils]: At program point L564-2(line 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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|))) [2024-11-25 03:36:00,591 INFO L77 FloydHoareUtils]: At program point L564-5(lines 564 565) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) (or (and .cse0 .cse1 |ULTIMATE.start_test_fun_#t~short15#1| .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) [2024-11-25 03:36:00,591 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) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (<= 1 |ULTIMATE.start_test_fun_#t~mem10#1|) (= |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|))) [2024-11-25 03:36:00,591 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 568 570) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-25 03:36:00,591 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,591 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,591 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,591 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,591 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,591 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,591 INFO L77 FloydHoareUtils]: At program point test_fun_returnLabel#1(lines 547 567) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-25 03:36:00,591 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,591 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,591 INFO L77 FloydHoareUtils]: At program point L566(line 566) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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|))) [2024-11-25 03:36:00,592 INFO L77 FloydHoareUtils]: At program point L566-1(line 566) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-25 03:36:00,592 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,592 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 03:36:00,592 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,592 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,592 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,592 INFO L77 FloydHoareUtils]: At program point L559-1(lines 559 561) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse5 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse7 (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (.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|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 |ULTIMATE.start_test_fun_#t~mem11#1|) .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse4 0)) (and .cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse2 .cse3 (< 0 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9))) [2024-11-25 03:36:00,592 INFO L77 FloydHoareUtils]: At program point L559-2(lines 559 561) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (< 0 (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_~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_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_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|))) [2024-11-25 03:36:00,593 INFO L77 FloydHoareUtils]: At program point L559-4(lines 559 561) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_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|))) [2024-11-25 03:36:00,593 INFO L77 FloydHoareUtils]: At program point L559-5(lines 553 563) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse6) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not .cse6) .cse0 .cse1 .cse2 .cse3 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse4 .cse5))) [2024-11-25 03:36:00,593 INFO L77 FloydHoareUtils]: At program point L551(line 551) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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)) [2024-11-25 03:36:00,594 INFO L77 FloydHoareUtils]: At program point L551-1(line 551) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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)) [2024-11-25 03:36:00,594 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,594 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,594 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,594 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK(lines 568 570) no Hoare annotation was computed. [2024-11-25 03:36:00,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,595 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) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem12#1|) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_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|))) [2024-11-25 03:36:00,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,596 INFO L77 FloydHoareUtils]: At program point L553-1(line 553) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse4 (not |ULTIMATE.start_test_fun_#t~short6#1|)) (.cse0 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse5 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not .cse7) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse4) .cse0 .cse1 .cse2 .cse3 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse5 .cse6))) [2024-11-25 03:36:00,596 INFO L77 FloydHoareUtils]: At program point L553-2(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_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|))) [2024-11-25 03:36:00,596 INFO L77 FloydHoareUtils]: At program point L553-5(lines 553 563) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse2 .cse3 (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse4 .cse5 (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not |ULTIMATE.start_test_fun_#t~short6#1|) .cse6 .cse7))) [2024-11-25 03:36:00,596 INFO L77 FloydHoareUtils]: At program point L553-6(lines 553 563) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (< 0 (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_~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_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_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|))) [2024-11-25 03:36:00,597 INFO L77 FloydHoareUtils]: At program point L553-8(lines 553 563) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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|))) [2024-11-25 03:36:00,597 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 03:36:00,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,597 INFO L77 FloydHoareUtils]: At program point L554(line 554) 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) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_#t~mem7#1| .cse0) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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|)) (<= (+ |ULTIMATE.start_test_fun_#t~mem7#1| 1) (* .cse0 2)))) [2024-11-25 03:36:00,598 INFO L77 FloydHoareUtils]: At program point L554-1(lines 554 562) 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) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_#t~mem7#1| .cse0) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (< 0 (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_~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) (<= 1 |ULTIMATE.start_test_fun_#t~mem8#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ |ULTIMATE.start_test_fun_#t~mem7#1| 1) (* .cse0 2)))) [2024-11-25 03:36:00,598 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,598 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,598 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,598 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,598 INFO L77 FloydHoareUtils]: At program point L555-1(lines 555 557) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse4 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_test_fun_#t~mem9#1| .cse7) .cse8 (<= 0 |ULTIMATE.start_test_fun_#t~mem9#1|)) (and .cse0 .cse1 .cse2 .cse3 (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 2 .cse7) .cse4 .cse5 .cse6 .cse8))) [2024-11-25 03:36:00,599 INFO L77 FloydHoareUtils]: At program point L555-2(lines 555 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_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|))) [2024-11-25 03:36:00,599 INFO L77 FloydHoareUtils]: At program point L555-4(lines 555 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#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) (= |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|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) [2024-11-25 03:36:00,599 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 03:36:00,606 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 03:36:00,607 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 03:36:00,610 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 03:36:00,610 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 03:36:00,611 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 03:36:00,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 03:36:00,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-25 03:36:00,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-25 03:36:00,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-25 03:36:00,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-25 03:36:00,612 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 03:36:00,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 03:36:00,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 03:36:00,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 03:36:00,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 03:36:00,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 03:36:00,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 03:36:00,613 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 03:36:00,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-25 03:36:00,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 03:36:00,614 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 03:36:00,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 03:36:00,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 03:36:00,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-25 03:36:00,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-25 03:36:00,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 03:36:00,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 03:36:00,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-25 03:36:00,615 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 03:36:00,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 03:36:00,618 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 03:36:00,618 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 03:36:00,618 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-25 03:36:00,618 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-25 03:36:00,618 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-25 03:36:00,618 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-25 03:36:00,619 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 03:36:00,619 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 03:36:00,619 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 03:36:00,619 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 03:36:00,619 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-25 03:36:00,619 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-25 03:36:00,619 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-25 03:36:00,619 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-25 03:36:00,620 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-25 03:36:00,620 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 03:36:00,620 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 03:36:00,620 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-25 03:36:00,620 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-25 03:36:00,620 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 03:36:00,620 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 03:36:00,620 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-25 03:36:00,620 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-25 03:36:00,621 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-25 03:36:00,621 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-25 03:36:00,621 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 03:36:00,621 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 03:36:00,621 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 03:36:00,621 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 03:36:00,621 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 03:36:00,622 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 03:36:00,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:36:00 ImpRootNode [2024-11-25 03:36:00,623 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:36:00,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:36:00,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:36:00,624 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:36:00,629 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:34:56" (3/4) ... [2024-11-25 03:36:00,631 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 03:36:00,643 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-25 03:36:00,643 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-25 03:36:00,643 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-25 03:36:00,643 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 03:36:00,756 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:36:00,757 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:36:00,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:36:00,759 INFO L158 Benchmark]: Toolchain (without parser) took 65759.26ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 91.7MB in the beginning and 176.8MB in the end (delta: -85.2MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. [2024-11-25 03:36:00,759 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:36:00,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.03ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 75.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 03:36:00,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.22ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 73.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:36:00,761 INFO L158 Benchmark]: Boogie Preprocessor took 24.34ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 72.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:36:00,762 INFO L158 Benchmark]: RCFGBuilder took 691.92ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 53.2MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 03:36:00,762 INFO L158 Benchmark]: CodeCheck took 64285.80ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 53.2MB in the beginning and 185.0MB in the end (delta: -131.8MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. [2024-11-25 03:36:00,763 INFO L158 Benchmark]: Witness Printer took 133.26ms. Allocated memory is still 394.3MB. Free memory was 185.0MB in the beginning and 176.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:36:00,765 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, 60 locations, 33 error locations. Started 1 CEGAR loops. OverallTime: 60.5s, OverallIterations: 67, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14606 SdHoareTripleChecker+Valid, 53.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13091 mSDsluCounter, 10616 SdHoareTripleChecker+Invalid, 46.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8944 mSDsCounter, 3927 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27728 IncrementalHoareTripleChecker+Invalid, 31655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3927 mSolverCounterUnsat, 1672 mSDtfsCounter, 27728 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8557 GetRequests, 7856 SyntacticMatches, 269 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89088 ImplicationChecksByTransitivity, 52.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 913 ConstructedInterpolants, 0 QuantifiedInterpolants, 5427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 66 InterpolantComputations, 57 PerfectInterpolantSequences, 144/157 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 33 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.03ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 75.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.22ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 73.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.34ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 72.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 691.92ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 53.2MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 64285.80ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 53.2MB in the beginning and 185.0MB in the end (delta: -131.8MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. * Witness Printer took 133.26ms. Allocated memory is still 394.3MB. Free memory was 185.0MB in the beginning and 176.8MB in the end (delta: 8.2MB). 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: 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: #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: ~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: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: 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: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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: ~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: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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: 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: #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: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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: ~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] RESULT: Ultimate proved your program to be correct! [2024-11-25 03:36:00,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cdd9298-6efd-4a0f-8c00-83a4a901049d/bin/ukojak-verify-ENZ3QT5qd3/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