./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.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_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ffd6e9554cad43049f3baa89c0ba2bf94011d3e069a47b1754df8be10679286a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 03:43:59,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 03:43:59,707 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-12-06 03:43:59,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 03:43:59,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 03:43:59,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 03:43:59,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 03:43:59,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 03:43:59,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 03:43:59,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 03:43:59,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 03:43:59,734 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-06 03:43:59,734 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-06 03:43:59,734 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-06 03:43:59,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 03:43:59,734 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 03:43:59,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 03:43:59,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 03:43:59,734 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 03:43:59,734 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 03:43:59,734 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 03:43:59,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 03:43:59,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 03:43:59,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 03:43:59,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 03:43:59,735 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 03:43:59,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 03:43:59,735 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_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ffd6e9554cad43049f3baa89c0ba2bf94011d3e069a47b1754df8be10679286a [2024-12-06 03:43:59,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 03:43:59,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 03:43:59,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 03:43:59,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 03:43:59,991 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 03:43:59,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i [2024-12-06 03:44:02,596 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/data/e139ad1d8/2417c0ce2b544bf5875a9b22a7b57818/FLAG8c13b96bb [2024-12-06 03:44:02,852 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 03:44:02,852 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i [2024-12-06 03:44:02,863 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/data/e139ad1d8/2417c0ce2b544bf5875a9b22a7b57818/FLAG8c13b96bb [2024-12-06 03:44:03,184 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/data/e139ad1d8/2417c0ce2b544bf5875a9b22a7b57818 [2024-12-06 03:44:03,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 03:44:03,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 03:44:03,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 03:44:03,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 03:44:03,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 03:44:03,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1489b3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03, skipping insertion in model container [2024-12-06 03:44:03,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 03:44:03,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 03:44:03,432 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 03:44:03,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 03:44:03,486 INFO L204 MainTranslator]: Completed translation [2024-12-06 03:44:03,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03 WrapperNode [2024-12-06 03:44:03,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 03:44:03,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 03:44:03,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 03:44:03,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 03:44:03,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,519 INFO L138 Inliner]: procedures = 111, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-12-06 03:44:03,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 03:44:03,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 03:44:03,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 03:44:03,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 03:44:03,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 03:44:03,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 03:44:03,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 03:44:03,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 03:44:03,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 03:44:03,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 03:44:03,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 03:44:03,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 03:44:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-06 03:44:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-06 03:44:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-06 03:44:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-06 03:44:03,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 03:44:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 03:44:03,670 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 03:44:03,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 03:44:03,862 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-12-06 03:44:03,862 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 03:44:03,899 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 03:44:03,900 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 03:44:03,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:44:03 BoogieIcfgContainer [2024-12-06 03:44:03,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 03:44:03,901 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 03:44:03,901 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 03:44:03,910 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 03:44:03,910 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:44:03" (1/1) ... [2024-12-06 03:44:03,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 03:44:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 49 states and 52 transitions. [2024-12-06 03:44:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-12-06 03:44:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 03:44:03,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:04,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-12-06 03:44:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 48 states and 51 transitions. [2024-12-06 03:44:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2024-12-06 03:44:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 03:44:04,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 47 states and 50 transitions. [2024-12-06 03:44:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-12-06 03:44:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 03:44:04,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 46 states and 49 transitions. [2024-12-06 03:44:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-12-06 03:44:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 03:44:04,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 45 states and 48 transitions. [2024-12-06 03:44:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-12-06 03:44:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 03:44:05,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 44 states and 47 transitions. [2024-12-06 03:44:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-12-06 03:44:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 03:44:05,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:05,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 43 states and 46 transitions. [2024-12-06 03:44:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-12-06 03:44:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 03:44:05,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 42 states and 45 transitions. [2024-12-06 03:44:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-12-06 03:44:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 03:44:06,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2024-12-06 03:44:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-12-06 03:44:07,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 03:44:07,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 42 states and 45 transitions. [2024-12-06 03:44:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-12-06 03:44:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 03:44:07,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:07,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 43 states and 48 transitions. [2024-12-06 03:44:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-12-06 03:44:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 03:44:08,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 45 states and 53 transitions. [2024-12-06 03:44:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-12-06 03:44:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 03:44:09,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:09,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 47 states and 58 transitions. [2024-12-06 03:44:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-12-06 03:44:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 03:44:09,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 51 states and 66 transitions. [2024-12-06 03:44:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-12-06 03:44:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 03:44:10,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:10,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 55 states and 73 transitions. [2024-12-06 03:44:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-12-06 03:44:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 03:44:10,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:10,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 56 states and 74 transitions. [2024-12-06 03:44:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2024-12-06 03:44:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 03:44:11,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:11,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 61 states and 87 transitions. [2024-12-06 03:44:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-12-06 03:44:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 03:44:11,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:11,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 66 states and 100 transitions. [2024-12-06 03:44:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 100 transitions. [2024-12-06 03:44:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 03:44:12,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:12,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 72 states and 115 transitions. [2024-12-06 03:44:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 115 transitions. [2024-12-06 03:44:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 03:44:15,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 76 states and 128 transitions. [2024-12-06 03:44:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 128 transitions. [2024-12-06 03:44:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 03:44:17,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:17,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 77 states and 131 transitions. [2024-12-06 03:44:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 131 transitions. [2024-12-06 03:44:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 03:44:17,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:17,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 82 states and 144 transitions. [2024-12-06 03:44:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 144 transitions. [2024-12-06 03:44:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 03:44:18,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 83 states and 145 transitions. [2024-12-06 03:44:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 145 transitions. [2024-12-06 03:44:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 03:44:18,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 87 states and 154 transitions. [2024-12-06 03:44:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 154 transitions. [2024-12-06 03:44:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 03:44:21,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:21,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 88 states and 156 transitions. [2024-12-06 03:44:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 156 transitions. [2024-12-06 03:44:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 03:44:21,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 95 states and 172 transitions. [2024-12-06 03:44:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 172 transitions. [2024-12-06 03:44:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 03:44:24,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:24,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 97 states and 176 transitions. [2024-12-06 03:44:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 176 transitions. [2024-12-06 03:44:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 03:44:24,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 100 states and 181 transitions. [2024-12-06 03:44:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 181 transitions. [2024-12-06 03:44:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 03:44:25,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:25,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 101 states and 184 transitions. [2024-12-06 03:44:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 184 transitions. [2024-12-06 03:44:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 03:44:25,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:25,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 103 states and 189 transitions. [2024-12-06 03:44:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2024-12-06 03:44:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 03:44:25,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 102 states and 188 transitions. [2024-12-06 03:44:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 188 transitions. [2024-12-06 03:44:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 03:44:25,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:25,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 103 states and 188 transitions. [2024-12-06 03:44:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 188 transitions. [2024-12-06 03:44:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 03:44:25,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:25,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 104 states and 197 transitions. [2024-12-06 03:44:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 197 transitions. [2024-12-06 03:44:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 03:44:25,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 104 states and 196 transitions. [2024-12-06 03:44:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 196 transitions. [2024-12-06 03:44:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 03:44:25,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:25,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 03:44:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 106 states and 197 transitions. [2024-12-06 03:44:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 197 transitions. [2024-12-06 03:44:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 03:44:25,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:25,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 03:44:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 108 states and 198 transitions. [2024-12-06 03:44:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 198 transitions. [2024-12-06 03:44:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 03:44:25,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:44:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 114 states and 208 transitions. [2024-12-06 03:44:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 208 transitions. [2024-12-06 03:44:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 03:44:26,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:26,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:44:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 122 states and 222 transitions. [2024-12-06 03:44:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 222 transitions. [2024-12-06 03:44:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 03:44:27,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:27,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:44:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 124 states and 225 transitions. [2024-12-06 03:44:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 225 transitions. [2024-12-06 03:44:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 03:44:28,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:44:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 126 states and 226 transitions. [2024-12-06 03:44:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 226 transitions. [2024-12-06 03:44:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 03:44:28,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:44:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 128 states and 229 transitions. [2024-12-06 03:44:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 229 transitions. [2024-12-06 03:44:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 03:44:28,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:44:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 128 states and 228 transitions. [2024-12-06 03:44:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 228 transitions. [2024-12-06 03:44:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 03:44:29,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:44:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 134 states and 236 transitions. [2024-12-06 03:44:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 236 transitions. [2024-12-06 03:44:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 03:44:29,571 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:44:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 140 states and 243 transitions. [2024-12-06 03:44:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 243 transitions. [2024-12-06 03:44:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 03:44:30,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:44:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 142 states and 246 transitions. [2024-12-06 03:44:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 246 transitions. [2024-12-06 03:44:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 03:44:30,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:44:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 144 states and 247 transitions. [2024-12-06 03:44:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 247 transitions. [2024-12-06 03:44:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 03:44:30,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 150 states and 256 transitions. [2024-12-06 03:44:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 256 transitions. [2024-12-06 03:44:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 03:44:35,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:44:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 163 states and 284 transitions. [2024-12-06 03:44:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 284 transitions. [2024-12-06 03:44:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 03:44:46,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 03:44:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 164 states and 285 transitions. [2024-12-06 03:44:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 285 transitions. [2024-12-06 03:44:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 03:44:46,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:46,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 03:44:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 165 states and 286 transitions. [2024-12-06 03:44:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 286 transitions. [2024-12-06 03:44:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 03:44:46,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 03:44:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 166 states and 287 transitions. [2024-12-06 03:44:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 287 transitions. [2024-12-06 03:44:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 03:44:48,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 03:44:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 168 states and 289 transitions. [2024-12-06 03:44:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 289 transitions. [2024-12-06 03:44:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 03:44:49,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 03:44:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:44:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 169 states and 290 transitions. [2024-12-06 03:44:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 290 transitions. [2024-12-06 03:44:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 03:44:50,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:44:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:44:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:44:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:45:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 176 states and 310 transitions. [2024-12-06 03:45:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 310 transitions. [2024-12-06 03:45:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 03:45:01,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:01,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:45:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 189 states and 342 transitions. [2024-12-06 03:45:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 342 transitions. [2024-12-06 03:45:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 03:45:31,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 03:45:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 195 states and 349 transitions. [2024-12-06 03:45:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 349 transitions. [2024-12-06 03:45:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 03:45:40,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 03:45:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 190 states and 340 transitions. [2024-12-06 03:45:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 340 transitions. [2024-12-06 03:45:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 03:45:41,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 03:45:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 191 states and 340 transitions. [2024-12-06 03:45:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 340 transitions. [2024-12-06 03:45:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 03:45:42,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 03:45:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 188 states and 335 transitions. [2024-12-06 03:45:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 335 transitions. [2024-12-06 03:45:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 03:45:42,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:42,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 03:45:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 187 states and 334 transitions. [2024-12-06 03:45:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 334 transitions. [2024-12-06 03:45:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 03:45:42,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:42,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 03:45:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 186 states and 333 transitions. [2024-12-06 03:45:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 333 transitions. [2024-12-06 03:45:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 03:45:42,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:42,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 03:45:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 188 states and 335 transitions. [2024-12-06 03:45:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 335 transitions. [2024-12-06 03:45:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 03:45:43,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:43,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 03:45:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 188 states and 334 transitions. [2024-12-06 03:45:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 334 transitions. [2024-12-06 03:45:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 03:45:44,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 03:45:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 190 states and 339 transitions. [2024-12-06 03:45:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 339 transitions. [2024-12-06 03:45:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 03:45:46,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:46,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 03:45:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 194 states and 347 transitions. [2024-12-06 03:45:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 347 transitions. [2024-12-06 03:45:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 03:45:47,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:47,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 03:45:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 195 states and 349 transitions. [2024-12-06 03:45:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 349 transitions. [2024-12-06 03:45:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 03:45:49,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:49,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 03:45:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 199 states and 356 transitions. [2024-12-06 03:45:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 356 transitions. [2024-12-06 03:45:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 03:45:50,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 03:45:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 201 states and 358 transitions. [2024-12-06 03:45:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2024-12-06 03:45:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 03:45:50,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 03:45:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 203 states and 359 transitions. [2024-12-06 03:45:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 359 transitions. [2024-12-06 03:45:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 03:45:50,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:50,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 03:45:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 203 states and 358 transitions. [2024-12-06 03:45:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 358 transitions. [2024-12-06 03:45:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 03:45:51,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:51,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 03:45:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 205 states and 361 transitions. [2024-12-06 03:45:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 361 transitions. [2024-12-06 03:45:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 03:45:52,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:52,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:45:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 209 states and 366 transitions. [2024-12-06 03:45:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 366 transitions. [2024-12-06 03:45:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 03:45:54,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:45:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 213 states and 370 transitions. [2024-12-06 03:45:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 370 transitions. [2024-12-06 03:45:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 03:45:55,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 03:45:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 215 states and 372 transitions. [2024-12-06 03:45:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 372 transitions. [2024-12-06 03:45:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 03:45:55,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:55,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 03:45:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 217 states and 373 transitions. [2024-12-06 03:45:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 373 transitions. [2024-12-06 03:45:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:45:55,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:55,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:45:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:45:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 221 states and 378 transitions. [2024-12-06 03:45:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 378 transitions. [2024-12-06 03:45:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:45:58,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:45:58,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:45:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:45:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 03:46:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:46:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 233 states and 405 transitions. [2024-12-06 03:46:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 405 transitions. [2024-12-06 03:46:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:46:07,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:46:07,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:46:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:46:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:46:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:46:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 242 states and 418 transitions. [2024-12-06 03:46:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 418 transitions. [2024-12-06 03:46:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:46:25,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:46:25,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:46:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:46:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 03:46:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:46:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 246 states and 426 transitions. [2024-12-06 03:46:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 426 transitions. [2024-12-06 03:46:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:46:37,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:46:37,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:46:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:46:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 03:46:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:46:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 250 states and 435 transitions. [2024-12-06 03:46:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2024-12-06 03:46:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 03:46:43,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:46:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:46:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:46:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:47:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:47:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 262 states and 467 transitions. [2024-12-06 03:47:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 467 transitions. [2024-12-06 03:47:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 03:47:25,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:47:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:47:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:47:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:47:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:47:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 264 states and 470 transitions. [2024-12-06 03:47:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 470 transitions. [2024-12-06 03:47:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 03:47:28,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:47:28,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:47:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:47:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 03:47:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:47:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 265 states and 470 transitions. [2024-12-06 03:47:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 470 transitions. [2024-12-06 03:47:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 03:47:30,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:47:30,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:47:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:47:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 03:47:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:47:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 265 states and 469 transitions. [2024-12-06 03:47:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 469 transitions. [2024-12-06 03:47:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-06 03:47:32,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:47:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:47:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:47:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:48:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:48:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 285 states and 519 transitions. [2024-12-06 03:48:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 519 transitions. [2024-12-06 03:48:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-06 03:48:19,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:48:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:48:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:48:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 03:48:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:48:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 287 states and 520 transitions. [2024-12-06 03:48:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 520 transitions. [2024-12-06 03:48:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-12-06 03:48:31,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:48:31,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:48:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:48:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 53 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 03:48:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:48:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 31 states and 37 transitions. [2024-12-06 03:48:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-12-06 03:48:47,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 03:48:47,355 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 87 iterations. [2024-12-06 03:48:47,362 INFO L726 CodeCheckObserver]: All specifications hold 29 specifications checked. All of them hold [2024-12-06 03:48:58,195 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,195 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 566 568) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,196 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,197 INFO L77 FloydHoareUtils]: At program point L561(line 561) the Hoare annotation is: (let ((.cse25 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse24 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse19 (select .cse25 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse21 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse20 (= (select .cse25 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0)) (.cse6 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse18 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse8 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse10 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse13 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse14 (<= (+ .cse24 1) .cse19)) (.cse15 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse17 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse22 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse23 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse14 .cse15 .cse16 .cse17 (or (and (<= (+ .cse18 1) .cse19) .cse20) .cse21) .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (or .cse21 .cse20)) .cse6 .cse7 (<= .cse24 .cse18) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse22 .cse23))))) [2024-12-06 03:48:58,198 INFO L77 FloydHoareUtils]: At program point L561-1(line 561) the Hoare annotation is: (let ((.cse25 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse9 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse7 (select .cse25 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse8 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse13 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse15 (= |ULTIMATE.start_test_fun_#t~mem13#1| .cse10)) (.cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse17 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse18 (<= (+ .cse9 1) .cse7)) (.cse19 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse20 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse21 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse22 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse23 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse24 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= .cse7 0)) .cse8 (<= .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse3 .cse4 .cse5 .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse18 .cse19 .cse20 .cse21 (or (and (<= (+ .cse10 1) .cse7) (= (select .cse25 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0)) (not .cse22)) .cse23 .cse24))))) [2024-12-06 03:48:58,198 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,199 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse7 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse8 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= |ULTIMATE.start_test_fun_#t~mem6#1| .cse10)) (.cse11 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse13 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse6 (or (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) 0))) (.cse16 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse18 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse19 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse20 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7 .cse8 .cse9 (<= .cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse17 .cse18 .cse19 .cse20 .cse21)))) [2024-12-06 03:48:58,199 INFO L77 FloydHoareUtils]: At program point L557-2(line 557) the Hoare annotation is: (let ((.cse22 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse0 (not |ULTIMATE.start_test_fun_#t~short9#1|)) (.cse23 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse18 (or .cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (select .cse23 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse7 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse8 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse9 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse12 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse15 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse19 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (< .cse22 (select .cse23 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (.cse20 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and (or .cse0 .cse1) .cse2 .cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse4 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse2 .cse3 .cse4 .cse5 (not .cse18) .cse6 .cse7 .cse8 .cse9 (<= .cse22 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse1 .cse20 .cse21)))) [2024-12-06 03:48:58,200 INFO L77 FloydHoareUtils]: At program point L557-3(line 557) the Hoare annotation is: (let ((.cse21 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse22 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse13 (or (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (select .cse22 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0))) (.cse6 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse10 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse15 (<= (+ .cse21 1) (select .cse22 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse18 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse19 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse20 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse13) .cse6 .cse7 (<= .cse21 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2024-12-06 03:48:58,200 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (= (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-12-06 03:48:58,200 INFO L77 FloydHoareUtils]: At program point L553-1(line 553) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-12-06 03:48:58,201 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK(lines 566 568) no Hoare annotation was computed. [2024-12-06 03:48:58,201 INFO L77 FloydHoareUtils]: At program point L557-6(lines 557 563) the Hoare annotation is: (let ((.cse23 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse26 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse24 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse25 (+ .cse23 1))) (let ((.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse10 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse11 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse12 (or (< .cse24 2147483647) (< .cse24 .cse25))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse13 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse14 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse19 (or (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (select .cse26 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0))) (.cse15 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse16 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse17 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse18 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse20 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse21 (<= .cse25 (select .cse26 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse8 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse22 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not |ULTIMATE.start_test_fun_#t~short9#1|) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse11 .cse12 .cse3 .cse13 .cse14 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse15 .cse16 .cse4 .cse5 .cse17 .cse18 .cse19 .cse20 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse21 .cse6 .cse7 .cse8 .cse22 .cse9) (and .cse0 .cse10 .cse2 .cse11 .cse12 .cse3 .cse13 .cse14 (not .cse19) .cse15 (<= .cse23 .cse24) .cse16 .cse4 .cse5 .cse17 .cse18 .cse20 .cse21 .cse6 .cse7 .cse8 .cse22 .cse9))))) [2024-12-06 03:48:58,201 INFO L77 FloydHoareUtils]: At program point L557-7(lines 557 563) the Hoare annotation is: (let ((.cse22 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse23 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse24 (+ .cse22 1)) (.cse25 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse5 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse6 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse14 (or (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (select .cse25 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0))) (.cse7 (or (<= .cse23 2147483646) (< .cse23 .cse24))) (.cse8 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse15 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse16 (<= .cse24 (select .cse25 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse18 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse19 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse20 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse14) .cse7 .cse8 (<= .cse22 .cse23) .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))))) [2024-12-06 03:48:58,202 INFO L77 FloydHoareUtils]: At program point L557-9(lines 557 563) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-12-06 03:48:58,202 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 03:48:58,202 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,202 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,202 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,202 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,202 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,202 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,202 INFO L77 FloydHoareUtils]: At program point L558(line 558) the Hoare annotation is: (let ((.cse28 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse18 (+ |ULTIMATE.start_test_fun_#t~mem10#1| 1)) (.cse29 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse19 (select .cse29 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse27 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse25 (< .cse28 .cse18))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse5 (or .cse25 (<= .cse28 2147483646))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse7 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse17 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse20 (= (select .cse29 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0)) (.cse8 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse9 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse13 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse26 (<= .cse27 |ULTIMATE.start_test_fun_#t~mem10#1|)) (.cse14 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse15 (<= (+ .cse27 1) .cse19)) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse21 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse22 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse23 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse24 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse15 .cse16 (or .cse17 (and (<= .cse18 .cse19) .cse20)) .cse21 .cse22 .cse23 .cse24 (or .cse25 .cse26)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (or .cse17 .cse20)) .cse8 (<= .cse27 .cse28) .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse21 .cse22 .cse23 .cse24))))) [2024-12-06 03:48:58,203 INFO L77 FloydHoareUtils]: At program point L558-1(lines 558 562) the Hoare annotation is: (let ((.cse29 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse28 (select .cse29 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse12 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (or (<= .cse12 |ULTIMATE.start_test_fun_#t~mem10#1|) (<= .cse12 2147483646))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse4 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse7 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse10 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse13 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse14 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse15 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse16 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse17 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse19 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse20 (<= (+ .cse11 1) .cse28)) (.cse21 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse8 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse9 (= (select .cse29 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0)) (.cse22 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse23 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse24 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse25 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse18 (<= .cse11 |ULTIMATE.start_test_fun_#t~mem10#1|)) (.cse26 (= |ULTIMATE.start_test_fun_#t~mem11#1| .cse12))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (or .cse8 .cse9)) .cse10 (<= .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse27 (+ |ULTIMATE.start_test_fun_#t~mem10#1| 1))) (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse20 .cse21 (or .cse8 (and (<= .cse27 .cse28) .cse9)) .cse22 .cse23 .cse24 .cse25 (or (< .cse12 .cse27) .cse18) .cse26)))))) [2024-12-06 03:48:58,203 INFO L77 FloydHoareUtils]: At program point L558-3(lines 557 563) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse13 (or (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) 0))) (.cse6 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse10 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse11 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse14 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse15 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse16 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse17 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse18 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse19 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse13) .cse6 .cse7 (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2024-12-06 03:48:58,203 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-12-06 03:48:58,204 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 03:48:58,204 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,204 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,204 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,204 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,204 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,204 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,204 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse0) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= .cse0 2147483646) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-12-06 03:48:58,204 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (<= (+ |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ |ULTIMATE.start_test_fun_#t~mem12#1| 1) .cse0) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= .cse0 2147483646) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-12-06 03:48:58,205 INFO L77 FloydHoareUtils]: At program point L555(line 555) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-12-06 03:48:58,205 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 03:48:58,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 03:48:58,212 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 03:48:58,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 03:48:58,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 03:48:58,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 03:48:58,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 03:48:58,218 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 03:48:58,218 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-12-06 03:48:58,219 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 03:48:58,220 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 03:48:58,221 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-12-06 03:48:58,221 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 03:48:58,221 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 03:48:58,221 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 03:48:58,221 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 03:48:58,221 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 03:48:58,221 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 03:48:58,221 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 03:48:58,221 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 03:48:58,222 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-12-06 03:48:58,223 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-12-06 03:48:58,224 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 03:48:58,225 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 03:48:58,225 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 03:48:58,225 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 03:48:58,226 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 03:48:58,226 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 03:48:58,226 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 03:48:58,226 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 03:48:58,226 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 03:48:58,226 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 03:48:58,226 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 03:48:58,226 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 03:48:58,226 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 03:48:58,226 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 03:48:58,227 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 03:48:58,227 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 03:48:58,227 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 03:48:58,227 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-06 03:48:58,227 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 03:48:58,227 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 03:48:58,227 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-06 03:48:58,228 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-06 03:48:58,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 03:48:58 ImpRootNode [2024-12-06 03:48:58,230 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 03:48:58,230 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 03:48:58,230 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 03:48:58,231 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 03:48:58,231 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:44:03" (3/4) ... [2024-12-06 03:48:58,233 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 03:48:58,240 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-12-06 03:48:58,240 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-06 03:48:58,240 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 03:48:58,240 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-06 03:48:58,313 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 03:48:58,314 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 03:48:58,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 03:48:58,315 INFO L158 Benchmark]: Toolchain (without parser) took 295127.62ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 116.6MB in the beginning and 593.0MB in the end (delta: -476.4MB). Peak memory consumption was 832.0MB. Max. memory is 16.1GB. [2024-12-06 03:48:58,315 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 03:48:58,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.69ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 100.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 03:48:58,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.65ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 03:48:58,316 INFO L158 Benchmark]: Boogie Preprocessor took 19.63ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.7MB in the end (delta: 855.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 03:48:58,316 INFO L158 Benchmark]: RCFGBuilder took 360.29ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 78.0MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 03:48:58,317 INFO L158 Benchmark]: CodeCheck took 294329.01ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 78.0MB in the beginning and 601.2MB in the end (delta: -523.1MB). Peak memory consumption was 781.6MB. Max. memory is 16.1GB. [2024-12-06 03:48:58,317 INFO L158 Benchmark]: Witness Printer took 83.63ms. Allocated memory is still 1.5GB. Free memory was 601.2MB in the beginning and 593.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 03:48:58,318 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, 49 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 283.4s, OverallIterations: 87, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34622 SdHoareTripleChecker+Valid, 109.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33652 mSDsluCounter, 11563 SdHoareTripleChecker+Invalid, 97.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10423 mSDsCounter, 7543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81840 IncrementalHoareTripleChecker+Invalid, 89383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7543 mSolverCounterUnsat, 1140 mSDtfsCounter, 81840 mSolverCounterSat, 1.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16455 GetRequests, 14612 SyntacticMatches, 687 SemanticMatches, 1156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790351 ImplicationChecksByTransitivity, 267.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 49.6s InterpolantComputationTime, 1677 NumberOfCodeBlocks, 1677 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 1591 ConstructedInterpolants, 0 QuantifiedInterpolants, 23764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 86 InterpolantComputations, 73 PerfectInterpolantSequences, 565/656 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: 566]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.69ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 100.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.65ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.63ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.7MB in the end (delta: 855.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 360.29ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 78.0MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 294329.01ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 78.0MB in the beginning and 601.2MB in the end (delta: -523.1MB). Peak memory consumption was 781.6MB. Max. memory is 16.1GB. * Witness Printer took 83.63ms. Allocated memory is still 1.5GB. Free memory was 601.2MB in the beginning and 593.0MB 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: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!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: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_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: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!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: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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[~z_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] RESULT: Ultimate proved your program to be correct! [2024-12-06 03:48:58,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb68b031-cff1-4998-9e02-5702dd4c2ce0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE