./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:34:52,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:34:52,439 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-08 19:34:52,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:34:52,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:34:52,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:34:52,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:34:52,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:34:52,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:34:52,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:34:52,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:34:52,482 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 19:34:52,483 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 19:34:52,484 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 19:34:52,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:34:52,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:34:52,485 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:34:52,485 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:34:52,488 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:34:52,489 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:34:52,489 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:34:52,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:34:52,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:34:52,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:34:52,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:34:52,514 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:34:52,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:34:52,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b [2024-11-08 19:34:52,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:34:52,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:34:52,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:34:52,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:34:52,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:34:52,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i Unable to find full path for "g++" [2024-11-08 19:34:54,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:34:55,192 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:34:55,192 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2024-11-08 19:34:55,206 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/data/defcc8800/687f08b9cbe847fe89f6674746e49440/FLAG1a2ed74f5 [2024-11-08 19:34:55,230 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/data/defcc8800/687f08b9cbe847fe89f6674746e49440 [2024-11-08 19:34:55,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:34:55,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:34:55,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:34:55,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:34:55,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:34:55,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652e0e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55, skipping insertion in model container [2024-11-08 19:34:55,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:34:55,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:34:55,626 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:34:55,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:34:55,699 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:34:55,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55 WrapperNode [2024-11-08 19:34:55,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:34:55,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:34:55,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:34:55,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:34:55,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,741 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2024-11-08 19:34:55,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:34:55,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:34:55,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:34:55,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:34:55,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:34:55,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:34:55,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:34:55,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:34:55,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:34:55" (1/1) ... [2024-11-08 19:34:55,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:34:55,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:34:55,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:34:55,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:34:55,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 19:34:55,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 19:34:55,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 19:34:55,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 19:34:55,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:34:55,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:34:55,967 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:34:55,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:34:56,314 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-11-08 19:34:56,314 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:34:56,397 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:34:56,397 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:34:56,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:34:56 BoogieIcfgContainer [2024-11-08 19:34:56,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:34:56,399 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:34:56,399 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:34:56,406 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:34:56,407 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:34:56" (1/1) ... [2024-11-08 19:34:56,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:34:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 68 states and 75 transitions. [2024-11-08 19:34:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2024-11-08 19:34:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 19:34:56,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:56,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 67 states and 74 transitions. [2024-11-08 19:34:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-11-08 19:34:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-08 19:34:56,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:56,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 66 states and 73 transitions. [2024-11-08 19:34:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-08 19:34:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 19:34:57,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:57,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 65 states and 72 transitions. [2024-11-08 19:34:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-11-08 19:34:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 19:34:57,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 64 states and 71 transitions. [2024-11-08 19:34:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-11-08 19:34:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 19:34:58,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 63 states and 70 transitions. [2024-11-08 19:34:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-11-08 19:34:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 19:34:58,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 62 states and 69 transitions. [2024-11-08 19:34:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-11-08 19:34:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:34:59,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 63 states and 71 transitions. [2024-11-08 19:34:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-08 19:34:59,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:34:59,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:59,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 64 states and 73 transitions. [2024-11-08 19:35:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-11-08 19:35:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:35:00,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 67 states and 79 transitions. [2024-11-08 19:35:00,245 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2024-11-08 19:35:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:35:00,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 70 states and 86 transitions. [2024-11-08 19:35:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2024-11-08 19:35:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:35:01,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:01,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 71 states and 88 transitions. [2024-11-08 19:35:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2024-11-08 19:35:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:35:01,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 72 states and 89 transitions. [2024-11-08 19:35:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2024-11-08 19:35:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:35:01,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:01,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 75 states and 95 transitions. [2024-11-08 19:35:01,481 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2024-11-08 19:35:01,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:35:01,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:01,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 80 states and 108 transitions. [2024-11-08 19:35:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2024-11-08 19:35:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:35:02,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 82 states and 110 transitions. [2024-11-08 19:35:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2024-11-08 19:35:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:35:02,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 85 states and 115 transitions. [2024-11-08 19:35:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2024-11-08 19:35:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:35:02,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:02,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 88 states and 120 transitions. [2024-11-08 19:35:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-11-08 19:35:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:35:03,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:03,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 93 states and 129 transitions. [2024-11-08 19:35:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-11-08 19:35:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:35:03,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:03,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 98 states and 138 transitions. [2024-11-08 19:35:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2024-11-08 19:35:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:35:03,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 106 states and 161 transitions. [2024-11-08 19:35:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 161 transitions. [2024-11-08 19:35:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:35:04,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:04,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 114 states and 182 transitions. [2024-11-08 19:35:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 182 transitions. [2024-11-08 19:35:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:35:04,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 115 states and 183 transitions. [2024-11-08 19:35:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 183 transitions. [2024-11-08 19:35:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:35:04,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:04,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 119 states and 192 transitions. [2024-11-08 19:35:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 192 transitions. [2024-11-08 19:35:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:35:05,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 123 states and 204 transitions. [2024-11-08 19:35:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 204 transitions. [2024-11-08 19:35:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:35:05,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 124 states and 206 transitions. [2024-11-08 19:35:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 206 transitions. [2024-11-08 19:35:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:35:05,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:05,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 125 states and 207 transitions. [2024-11-08 19:35:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 207 transitions. [2024-11-08 19:35:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 19:35:05,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 125 states and 206 transitions. [2024-11-08 19:35:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 206 transitions. [2024-11-08 19:35:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 19:35:05,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 126 states and 206 transitions. [2024-11-08 19:35:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 206 transitions. [2024-11-08 19:35:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 19:35:05,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:05,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 128 states and 208 transitions. [2024-11-08 19:35:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 208 transitions. [2024-11-08 19:35:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:35:06,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:06,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 130 states and 209 transitions. [2024-11-08 19:35:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 209 transitions. [2024-11-08 19:35:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:35:06,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:06,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 132 states and 210 transitions. [2024-11-08 19:35:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 210 transitions. [2024-11-08 19:35:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:35:06,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:06,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 134 states and 216 transitions. [2024-11-08 19:35:06,659 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 216 transitions. [2024-11-08 19:35:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:35:06,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:06,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 135 states and 218 transitions. [2024-11-08 19:35:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 218 transitions. [2024-11-08 19:35:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:35:06,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:06,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 137 states and 220 transitions. [2024-11-08 19:35:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 220 transitions. [2024-11-08 19:35:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:35:07,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:07,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 141 states and 226 transitions. [2024-11-08 19:35:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 226 transitions. [2024-11-08 19:35:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:35:09,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:09,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 143 states and 230 transitions. [2024-11-08 19:35:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 230 transitions. [2024-11-08 19:35:09,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:35:09,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:09,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 145 states and 235 transitions. [2024-11-08 19:35:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 235 transitions. [2024-11-08 19:35:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:35:10,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:10,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 147 states and 237 transitions. [2024-11-08 19:35:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 237 transitions. [2024-11-08 19:35:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:35:10,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:10,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 149 states and 241 transitions. [2024-11-08 19:35:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 241 transitions. [2024-11-08 19:35:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:35:11,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:11,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 151 states and 243 transitions. [2024-11-08 19:35:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 243 transitions. [2024-11-08 19:35:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:35:11,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:11,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 154 states and 249 transitions. [2024-11-08 19:35:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 249 transitions. [2024-11-08 19:35:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:35:12,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:12,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 167 states and 278 transitions. [2024-11-08 19:35:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 278 transitions. [2024-11-08 19:35:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:35:18,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 170 states and 285 transitions. [2024-11-08 19:35:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 285 transitions. [2024-11-08 19:35:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:35:19,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:19,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 172 states and 286 transitions. [2024-11-08 19:35:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 286 transitions. [2024-11-08 19:35:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:35:20,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:20,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 175 states and 291 transitions. [2024-11-08 19:35:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 291 transitions. [2024-11-08 19:35:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:35:22,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:22,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 180 states and 298 transitions. [2024-11-08 19:35:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 298 transitions. [2024-11-08 19:35:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:35:23,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:23,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 184 states and 303 transitions. [2024-11-08 19:35:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 303 transitions. [2024-11-08 19:35:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:35:24,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 185 states and 305 transitions. [2024-11-08 19:35:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 305 transitions. [2024-11-08 19:35:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:35:25,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:25,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 187 states and 309 transitions. [2024-11-08 19:35:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 309 transitions. [2024-11-08 19:35:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 19:35:25,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:25,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 188 states and 309 transitions. [2024-11-08 19:35:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 309 transitions. [2024-11-08 19:35:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:35:25,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:25,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-11-08 19:35:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 187 states and 308 transitions. [2024-11-08 19:35:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 308 transitions. [2024-11-08 19:35:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:35:26,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 194 states and 320 transitions. [2024-11-08 19:35:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 320 transitions. [2024-11-08 19:35:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:35:30,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 199 states and 331 transitions. [2024-11-08 19:35:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 331 transitions. [2024-11-08 19:35:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:35:31,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:31,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 201 states and 332 transitions. [2024-11-08 19:35:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 332 transitions. [2024-11-08 19:35:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:35:32,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:32,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:32,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-11-08 19:35:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 204 states and 339 transitions. [2024-11-08 19:35:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 339 transitions. [2024-11-08 19:35:33,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:35:33,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:33,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 206 states and 340 transitions. [2024-11-08 19:35:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 340 transitions. [2024-11-08 19:35:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:35:34,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:34,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 210 states and 348 transitions. [2024-11-08 19:35:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2024-11-08 19:35:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 19:35:34,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:34,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 216 states and 355 transitions. [2024-11-08 19:35:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 355 transitions. [2024-11-08 19:35:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 19:35:40,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 215 states and 354 transitions. [2024-11-08 19:35:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 354 transitions. [2024-11-08 19:35:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 19:35:40,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 214 states and 353 transitions. [2024-11-08 19:35:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 353 transitions. [2024-11-08 19:35:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:35:40,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:40,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 213 states and 351 transitions. [2024-11-08 19:35:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 351 transitions. [2024-11-08 19:35:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:35:40,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:40,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 215 states and 355 transitions. [2024-11-08 19:35:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 355 transitions. [2024-11-08 19:35:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:35:40,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:35:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 217 states and 359 transitions. [2024-11-08 19:35:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 359 transitions. [2024-11-08 19:35:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:35:41,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:35:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 217 states and 358 transitions. [2024-11-08 19:35:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 358 transitions. [2024-11-08 19:35:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:35:41,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 218 states and 359 transitions. [2024-11-08 19:35:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 359 transitions. [2024-11-08 19:35:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 19:35:42,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 217 states and 358 transitions. [2024-11-08 19:35:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 358 transitions. [2024-11-08 19:35:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 19:35:42,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:42,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 218 states and 360 transitions. [2024-11-08 19:35:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 360 transitions. [2024-11-08 19:35:42,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:35:42,835 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:42,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:35:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 220 states and 362 transitions. [2024-11-08 19:35:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 362 transitions. [2024-11-08 19:35:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:35:42,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:35:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 222 states and 364 transitions. [2024-11-08 19:35:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 364 transitions. [2024-11-08 19:35:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:35:42,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:35:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 224 states and 366 transitions. [2024-11-08 19:35:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 366 transitions. [2024-11-08 19:35:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:35:43,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:35:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 224 states and 365 transitions. [2024-11-08 19:35:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 365 transitions. [2024-11-08 19:35:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:35:43,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:43,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 19:35:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 227 states and 370 transitions. [2024-11-08 19:35:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 370 transitions. [2024-11-08 19:35:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:35:43,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:43,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:35:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 228 states and 370 transitions. [2024-11-08 19:35:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 370 transitions. [2024-11-08 19:35:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:35:43,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:43,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:35:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 230 states and 372 transitions. [2024-11-08 19:35:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 372 transitions. [2024-11-08 19:35:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:35:43,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:35:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 234 states and 376 transitions. [2024-11-08 19:35:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 376 transitions. [2024-11-08 19:35:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:35:43,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:43,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:35:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 238 states and 380 transitions. [2024-11-08 19:35:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 380 transitions. [2024-11-08 19:35:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:35:43,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:43,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:35:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 240 states and 382 transitions. [2024-11-08 19:35:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 382 transitions. [2024-11-08 19:35:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:35:43,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:43,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:35:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 242 states and 384 transitions. [2024-11-08 19:35:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 384 transitions. [2024-11-08 19:35:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:35:43,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:43,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:35:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 244 states and 385 transitions. [2024-11-08 19:35:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 385 transitions. [2024-11-08 19:35:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 19:35:43,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:43,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:35:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 246 states and 386 transitions. [2024-11-08 19:35:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 386 transitions. [2024-11-08 19:35:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 19:35:44,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:35:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 248 states and 387 transitions. [2024-11-08 19:35:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 387 transitions. [2024-11-08 19:35:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:35:44,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:44,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 253 states and 394 transitions. [2024-11-08 19:35:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 394 transitions. [2024-11-08 19:35:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 19:35:47,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 258 states and 402 transitions. [2024-11-08 19:35:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 402 transitions. [2024-11-08 19:35:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 19:35:56,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:56,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:36:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 45 states and 52 transitions. [2024-11-08 19:36:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-11-08 19:36:01,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:36:01,688 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 85 iterations. [2024-11-08 19:36:01,696 INFO L729 CodeCheckObserver]: All specifications hold 37 specifications checked. All of them hold [2024-11-08 19:36:04,915 INFO L77 FloydHoareUtils]: At program point L555-11(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse11 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse12 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not |ULTIMATE.start_test_fun_#t~short12#1|) .cse11 .cse12))) [2024-11-08 19:36:04,916 INFO L77 FloydHoareUtils]: At program point L555-12(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,916 INFO L77 FloydHoareUtils]: At program point L555-13(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,916 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK(lines 567 569) no Hoare annotation was computed. [2024-11-08 19:36:04,917 INFO L77 FloydHoareUtils]: At program point L555-16(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse8 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) .cse3 .cse4 .cse5 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not |ULTIMATE.start_test_fun_#t~short12#1|) .cse8 .cse9))) [2024-11-08 19:36:04,917 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,917 INFO L77 FloydHoareUtils]: At program point L555-17(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse8 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not |ULTIMATE.start_test_fun_#t~short13#1|) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse7 .cse8 .cse9))) [2024-11-08 19:36:04,918 INFO L77 FloydHoareUtils]: At program point L555-18(line 555) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse8 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not |ULTIMATE.start_test_fun_#t~short16#1|) .cse6 .cse7 .cse8 .cse9))) [2024-11-08 19:36:04,918 INFO L77 FloydHoareUtils]: At program point L555-19(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,918 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,918 INFO L77 FloydHoareUtils]: At program point L555-20(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem14#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,919 INFO L77 FloydHoareUtils]: At program point L555-23(lines 555 564) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse5 (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (not |ULTIMATE.start_test_fun_#t~short16#1|) .cse4 .cse5 .cse6) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) .cse0 .cse1 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (< 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) .cse2 .cse3 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse4 .cse5 .cse6))) [2024-11-08 19:36:04,919 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,919 INFO L77 FloydHoareUtils]: At program point L555-25(lines 555 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,920 INFO L77 FloydHoareUtils]: At program point L556(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,920 INFO L77 FloydHoareUtils]: At program point L556-1(lines 556 563) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= .cse0 |ULTIMATE.start_test_fun_#t~mem17#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-08 19:36:04,920 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 567 569) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 19:36:04,920 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,920 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,921 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,921 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,921 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,921 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,922 INFO L77 FloydHoareUtils]: At program point L557-1(line 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,922 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,922 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,922 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,922 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,922 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,923 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 19:36:04,923 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,923 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,923 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,923 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,924 INFO L77 FloydHoareUtils]: At program point L559-1(lines 559 562) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem19#1|) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,924 INFO L77 FloydHoareUtils]: At program point L559-3(lines 555 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,924 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,924 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,924 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,924 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,924 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,925 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,925 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,925 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,925 INFO L77 FloydHoareUtils]: At program point L552(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,925 INFO L77 FloydHoareUtils]: At program point L552-1(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 4) (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,925 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,926 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,926 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,926 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,926 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,926 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,926 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 19:36:04,926 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,926 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,927 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,927 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,927 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,927 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,927 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,927 INFO L77 FloydHoareUtils]: At program point L555-1(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (or |ULTIMATE.start_test_fun_#t~short8#1| (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,927 INFO L77 FloydHoareUtils]: At program point L555-2(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,928 INFO L77 FloydHoareUtils]: At program point L555-3(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem7#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,929 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,929 INFO L77 FloydHoareUtils]: At program point L555-6(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,929 INFO L77 FloydHoareUtils]: At program point L555-7(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,929 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 19:36:04,930 INFO L77 FloydHoareUtils]: At program point L555-9(line 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-08 19:36:04,942 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 19:36:04,943 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:36:04,950 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:36:04,950 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 19:36:04,952 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:36:04,952 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 19:36:04,952 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:36:04,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:36:04,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-08 19:36:04,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:36:04,956 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:36:04,956 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-08 19:36:04,956 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-08 19:36:04,956 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 19:36:04,957 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 19:36:04,957 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:36:04,957 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 19:36:04,957 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 19:36:04,957 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 19:36:04,957 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:36:04,958 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:36:04,958 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 19:36:04,958 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 19:36:04,958 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 19:36:04,958 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 19:36:04,959 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 19:36:04,959 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 19:36:04,959 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:36:04,959 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:36:04,960 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:36:04,960 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-08 19:36:04,960 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-08 19:36:04,960 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-08 19:36:04,960 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-08 19:36:04,960 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 19:36:04,960 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 19:36:04,961 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 19:36:04,961 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 19:36:04,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:36:04 ImpRootNode [2024-11-08 19:36:04,964 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:36:04,964 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:36:04,965 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:36:04,965 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:36:04,966 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:34:56" (3/4) ... [2024-11-08 19:36:04,968 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:36:04,979 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-08 19:36:04,979 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-08 19:36:04,980 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 19:36:04,980 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 19:36:05,088 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:36:05,089 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 19:36:05,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:36:05,089 INFO L158 Benchmark]: Toolchain (without parser) took 69853.57ms. Allocated memory was 146.8MB in the beginning and 721.4MB in the end (delta: 574.6MB). Free memory was 104.8MB in the beginning and 453.4MB in the end (delta: -348.7MB). Peak memory consumption was 227.7MB. Max. memory is 16.1GB. [2024-11-08 19:36:05,090 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 146.8MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:36:05,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.71ms. Allocated memory is still 146.8MB. Free memory was 104.8MB in the beginning and 85.9MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 19:36:05,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.17ms. Allocated memory is still 146.8MB. Free memory was 85.9MB in the beginning and 84.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:36:05,090 INFO L158 Benchmark]: Boogie Preprocessor took 27.97ms. Allocated memory is still 146.8MB. Free memory was 84.4MB in the beginning and 82.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:36:05,091 INFO L158 Benchmark]: RCFGBuilder took 626.42ms. Allocated memory is still 146.8MB. Free memory was 82.8MB in the beginning and 59.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 19:36:05,091 INFO L158 Benchmark]: CodeCheck took 68565.28ms. Allocated memory was 146.8MB in the beginning and 721.4MB in the end (delta: 574.6MB). Free memory was 59.2MB in the beginning and 458.7MB in the end (delta: -399.5MB). Peak memory consumption was 177.4MB. Max. memory is 16.1GB. [2024-11-08 19:36:05,091 INFO L158 Benchmark]: Witness Printer took 124.45ms. Allocated memory is still 721.4MB. Free memory was 458.7MB in the beginning and 453.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:36:05,096 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 68 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 65.3s, OverallIterations: 85, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25729 SdHoareTripleChecker+Valid, 88.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24160 mSDsluCounter, 25095 SdHoareTripleChecker+Invalid, 77.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21408 mSDsCounter, 8009 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47941 IncrementalHoareTripleChecker+Invalid, 55950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8009 mSolverCounterUnsat, 3687 mSDtfsCounter, 47941 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12229 GetRequests, 11203 SyntacticMatches, 526 SemanticMatches, 500 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130084 ImplicationChecksByTransitivity, 55.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1370 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 1286 ConstructedInterpolants, 0 QuantifiedInterpolants, 11691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 84 InterpolantComputations, 84 PerfectInterpolantSequences, 110/110 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 37 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.85ms. Allocated memory is still 146.8MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.71ms. Allocated memory is still 146.8MB. Free memory was 104.8MB in the beginning and 85.9MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.17ms. Allocated memory is still 146.8MB. Free memory was 85.9MB in the beginning and 84.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.97ms. Allocated memory is still 146.8MB. Free memory was 84.4MB in the beginning and 82.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 626.42ms. Allocated memory is still 146.8MB. Free memory was 82.8MB in the beginning and 59.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * CodeCheck took 68565.28ms. Allocated memory was 146.8MB in the beginning and 721.4MB in the end (delta: 574.6MB). Free memory was 59.2MB in the beginning and 458.7MB in the end (delta: -399.5MB). Peak memory consumption was 177.4MB. Max. memory is 16.1GB. * Witness Printer took 124.45ms. Allocated memory is still 721.4MB. Free memory was 458.7MB in the beginning and 453.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] RESULT: Ultimate proved your program to be correct! [2024-11-08 19:36:05,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97259367-ce06-4132-8ad6-c4963a25f35b/bin/ukojak-verify-ImItNfHLgk/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