./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef47df31d033e531a0040913ad039c21826bf787c77c5128ceae3ef436a47b49 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 06:24:59,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 06:25:00,017 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-12-06 06:25:00,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 06:25:00,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 06:25:00,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 06:25:00,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 06:25:00,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 06:25:00,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 06:25:00,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 06:25:00,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 06:25:00,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 06:25:00,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 06:25:00,044 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-06 06:25:00,044 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-06 06:25:00,044 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-06 06:25:00,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 06:25:00,044 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 06:25:00,045 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 06:25:00,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 06:25:00,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 06:25:00,045 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 06:25:00,045 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 06:25:00,045 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 06:25:00,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 06:25:00,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 06:25:00,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 06:25:00,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 06:25:00,046 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 06:25:00,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 06:25:00,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef47df31d033e531a0040913ad039c21826bf787c77c5128ceae3ef436a47b49 [2024-12-06 06:25:00,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 06:25:00,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 06:25:00,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 06:25:00,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 06:25:00,290 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 06:25:00,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2024-12-06 06:25:02,960 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/data/f0af1ab7e/61f1f2451ccf4b5eb6264c9c04cc6cf4/FLAG18635928f [2024-12-06 06:25:03,172 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 06:25:03,173 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2024-12-06 06:25:03,184 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/data/f0af1ab7e/61f1f2451ccf4b5eb6264c9c04cc6cf4/FLAG18635928f [2024-12-06 06:25:03,506 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/data/f0af1ab7e/61f1f2451ccf4b5eb6264c9c04cc6cf4 [2024-12-06 06:25:03,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 06:25:03,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 06:25:03,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 06:25:03,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 06:25:03,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 06:25:03,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca7ee39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03, skipping insertion in model container [2024-12-06 06:25:03,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 06:25:03,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 06:25:03,741 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 06:25:03,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 06:25:03,797 INFO L204 MainTranslator]: Completed translation [2024-12-06 06:25:03,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03 WrapperNode [2024-12-06 06:25:03,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 06:25:03,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 06:25:03,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 06:25:03,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 06:25:03,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,829 INFO L138 Inliner]: procedures = 125, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-12-06 06:25:03,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 06:25:03,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 06:25:03,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 06:25:03,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 06:25:03,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,845 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 06:25:03,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 06:25:03,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 06:25:03,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 06:25:03,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:03" (1/1) ... [2024-12-06 06:25:03,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 06:25:03,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 06:25:03,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 06:25:03,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 06:25:03,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-06 06:25:03,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-06 06:25:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-06 06:25:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 06:25:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-06 06:25:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-12-06 06:25:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-12-06 06:25:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-06 06:25:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 06:25:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 06:25:03,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 06:25:03,982 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 06:25:03,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 06:25:04,190 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-12-06 06:25:04,191 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 06:25:04,226 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 06:25:04,226 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-06 06:25:04,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:04 BoogieIcfgContainer [2024-12-06 06:25:04,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 06:25:04,227 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 06:25:04,227 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 06:25:04,234 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 06:25:04,234 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:04" (1/1) ... [2024-12-06 06:25:04,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 06:25:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2024-12-06 06:25:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2024-12-06 06:25:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 06:25:04,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2024-12-06 06:25:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2024-12-06 06:25:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 06:25:04,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:04,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2024-12-06 06:25:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2024-12-06 06:25:04,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 06:25:04,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2024-12-06 06:25:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2024-12-06 06:25:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 06:25:04,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:04,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2024-12-06 06:25:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2024-12-06 06:25:04,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 06:25:04,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:04,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2024-12-06 06:25:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2024-12-06 06:25:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 06:25:04,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:04,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2024-12-06 06:25:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2024-12-06 06:25:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 06:25:05,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:05,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2024-12-06 06:25:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2024-12-06 06:25:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 06:25:05,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:05,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2024-12-06 06:25:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2024-12-06 06:25:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 06:25:06,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:06,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-12-06 06:25:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-12-06 06:25:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 06:25:06,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:06,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2024-12-06 06:25:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2024-12-06 06:25:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 06:25:06,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2024-12-06 06:25:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2024-12-06 06:25:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 06:25:08,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:08,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2024-12-06 06:25:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2024-12-06 06:25:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 06:25:10,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:10,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2024-12-06 06:25:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2024-12-06 06:25:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 06:25:13,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:13,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2024-12-06 06:25:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2024-12-06 06:25:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 06:25:17,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2024-12-06 06:25:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2024-12-06 06:25:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 06:25:18,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:18,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2024-12-06 06:25:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2024-12-06 06:25:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 06:25:18,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2024-12-06 06:25:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2024-12-06 06:25:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 06:25:18,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2024-12-06 06:25:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2024-12-06 06:25:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 06:25:19,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:19,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2024-12-06 06:25:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2024-12-06 06:25:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 06:25:19,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2024-12-06 06:25:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2024-12-06 06:25:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 06:25:19,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:19,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-12-06 06:25:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-12-06 06:25:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-12-06 06:25:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 06:25:19,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-12-06 06:25:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-12-06 06:25:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 06:25:20,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-12-06 06:25:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-12-06 06:25:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 06:25:20,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-12-06 06:25:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-12-06 06:25:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 06:25:21,160 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:21,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-12-06 06:25:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-12-06 06:25:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 06:25:29,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2024-12-06 06:25:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2024-12-06 06:25:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 06:25:39,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:25:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:25:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-12-06 06:25:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-12-06 06:25:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 06:25:49,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:25:49,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:25:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:25:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:26:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2024-12-06 06:26:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2024-12-06 06:26:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 06:26:05,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:05,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:08,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:26:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2024-12-06 06:26:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2024-12-06 06:26:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 06:26:11,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:26:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:26:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 31 states and 30 transitions. [2024-12-06 06:26:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2024-12-06 06:26:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 06:26:36,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:26:36,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:26:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:26:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:27:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:27:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 30 states and 29 transitions. [2024-12-06 06:27:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2024-12-06 06:27:05,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 06:27:05,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:27:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:27:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:27:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:27:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:27:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 29 states and 28 transitions. [2024-12-06 06:27:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2024-12-06 06:27:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 06:27:09,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:27:09,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:27:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:27:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:27:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:27:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 28 states and 27 transitions. [2024-12-06 06:27:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2024-12-06 06:27:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 06:27:22,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:27:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:27:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:27:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:28:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:28:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 27 states and 26 transitions. [2024-12-06 06:28:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2024-12-06 06:28:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 06:28:01,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:28:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:28:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:28:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:28:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:28:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 26 states and 25 transitions. [2024-12-06 06:28:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2024-12-06 06:28:23,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 06:28:23,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 06:28:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 06:28:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 06:28:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 06:29:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 06:29:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 25 states and 24 transitions. [2024-12-06 06:29:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2024-12-06 06:29:46,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 06:29:46,340 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 37 iterations. [2024-12-06 06:29:46,348 INFO L726 CodeCheckObserver]: All specifications hold 35 specifications checked. All of them hold [2024-12-06 06:29:46,818 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,818 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,818 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,818 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,818 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,819 INFO L77 FloydHoareUtils]: At program point L531(line 531) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|))) (let ((.cse0 (select .cse5 |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (let ((.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (.cse4 (select |#length| .cse0)) (.cse1 (select .cse5 4)) (.cse3 (select .cse5 0))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| .cse0) 1) (<= (+ .cse1 1) |#StackHeapBarrier|) (= (select .cse2 |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (select .cse2 4) 0) (= (store (store (store |#valid| .cse1 0) .cse3 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= .cse4 4) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= (select |#length| (select .cse5 (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| 4))) 4) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| .cse1) 1) (<= 4 .cse4) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1) (not (= .cse1 .cse3)))))) [2024-12-06 06:29:46,819 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,819 INFO L77 FloydHoareUtils]: At program point L531-1(line 531) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|))) (let ((.cse3 (select .cse4 0)) (.cse2 (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| 4)) (.cse0 (select .cse4 4)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| .cse0)) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select .cse1 .cse2) 0) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| .cse3) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~mem5#1.base|) 1) (<= (+ (select .cse4 |ULTIMATE.start_alloc_data_~pdata#1.offset|) 1) |#StackHeapBarrier|) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (store (store (store |#valid| .cse0 0) .cse3 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= (select |#length| (select .cse4 .cse2)) 4) (= |ULTIMATE.start_alloc_data_#t~mem5#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| .cse0) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_alloc_data_#t~mem5#1.base|)) (= (select |#valid| 0) 0) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1) (= |ULTIMATE.start_alloc_data_#t~mem5#1.offset| (select .cse1 0))))) [2024-12-06 06:29:46,820 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,820 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,820 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 543 548) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-06 06:29:46,820 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE(line 541) no Hoare annotation was computed. [2024-12-06 06:29:46,820 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE(line 540) no Hoare annotation was computed. [2024-12-06 06:29:46,820 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,820 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,820 INFO L77 FloydHoareUtils]: At program point L540(line 540) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-12-06 06:29:46,820 INFO L77 FloydHoareUtils]: At program point L540-1(line 540) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-12-06 06:29:46,821 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,821 INFO L77 FloydHoareUtils]: At program point L540-2(line 540) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-12-06 06:29:46,821 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,821 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,821 INFO L77 FloydHoareUtils]: At program point L532(line 532) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|))) (let ((.cse2 (+ |ULTIMATE.start_alloc_data_~pdata#1.offset| 4)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (.cse0 (select .cse4 4)) (.cse3 (select .cse4 0)) (.cse5 (select .cse4 |ULTIMATE.start_main_~#data~0#1.offset|))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select .cse1 .cse2) 0) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (store (store (store |#valid| .cse0 0) .cse3 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select (select |#memory_int| .cse3) (select .cse1 0)) 4) (= (select |#length| (select .cse4 .cse2)) 4) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (<= 4 (select |#length| .cse5)) (= (select |#valid| .cse0) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (select .cse1 |ULTIMATE.start_main_~#data~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1) (= (select |#valid| .cse5) 1) (not (= .cse0 .cse3)) (<= (+ .cse5 1) |#StackHeapBarrier|)))) [2024-12-06 06:29:46,821 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,822 INFO L77 FloydHoareUtils]: At program point L532-1(line 532) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|))) (let ((.cse1 (select .cse4 0)) (.cse2 (select .cse4 (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) (.cse0 (select .cse4 |ULTIMATE.start_main_~#data~0#1.offset|)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ .cse0 1) |#StackHeapBarrier|) (<= 4 (select |#length| .cse0)) (= (select |#valid| .cse0) 1) (not (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| .cse1)) (<= (+ .cse2 1) |#StackHeapBarrier|) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1) (= .cse2 |ULTIMATE.start_alloc_data_#t~mem6#1.base|) (= (select (select |#memory_int| .cse1) (select .cse3 0)) 4) (= (select .cse3 |ULTIMATE.start_main_~#data~0#1.offset|) 0) (= (store (store (store |#valid| .cse2 0) .cse0 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select .cse3 4) |ULTIMATE.start_alloc_data_#t~mem6#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~mem6#1.base|) 1) (= |ULTIMATE.start_alloc_data_#t~mem6#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (select |#length| |ULTIMATE.start_alloc_data_#t~mem6#1.base|) 4)))) [2024-12-06 06:29:46,822 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,822 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE(line 540) no Hoare annotation was computed. [2024-12-06 06:29:46,822 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE(line 541) no Hoare annotation was computed. [2024-12-06 06:29:46,822 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK(lines 543 548) no Hoare annotation was computed. [2024-12-06 06:29:46,822 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 06:29:46,822 INFO L77 FloydHoareUtils]: At program point L541(line 541) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) [2024-12-06 06:29:46,822 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,823 INFO L77 FloydHoareUtils]: At program point L541-1(line 541) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) [2024-12-06 06:29:46,823 INFO L77 FloydHoareUtils]: At program point L541-2(line 541) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) [2024-12-06 06:29:46,823 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,823 INFO L77 FloydHoareUtils]: At program point L537(line 537) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) .cse2)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) .cse2))) (and (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) .cse0 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= .cse0 |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (= .cse1 0) (<= 4 (select |#length| .cse0)) (<= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (<= (+ .cse0 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= .cse0 |ULTIMATE.start_free_data_~#data#1.base|)) (= (select |#valid| 0) 0) (= (select (select |#memory_int| |ULTIMATE.start_free_data_~lo~0#1.base|) |ULTIMATE.start_free_data_~lo~0#1.offset|) 4) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (= (select (select |#memory_int| .cse0) .cse1) 8) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (select |#valid| .cse0) 1)))) [2024-12-06 06:29:46,823 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,823 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,823 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,823 INFO L77 FloydHoareUtils]: At program point L529(line 529) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= (select |#length| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 4) (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= (store (store |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1)) [2024-12-06 06:29:46,824 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE(line 541) no Hoare annotation was computed. [2024-12-06 06:29:46,824 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,824 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 06:29:46,824 INFO L77 FloydHoareUtils]: At program point L546(line 546) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|))) (let ((.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|)) (.cse0 (select .cse4 |ULTIMATE.start_main_~#data~0#1.offset|)) (.cse1 (select .cse4 .cse3))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#valid| .cse1) 1) (<= 4 (select |#length| .cse0)) (= (select |#valid| .cse0) 1) (= (select .cse2 .cse3) 0) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1) (= (select (select |#memory_int| (select .cse4 0)) (select .cse2 0)) 4) (= (select (select |#memory_int| (select .cse4 4)) (select .cse2 4)) 8) (= (select .cse2 |ULTIMATE.start_main_~#data~0#1.offset|) 0) (= (store (store (store |#valid| .cse1 0) .cse0 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (< .cse1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (<= 4 (select |#length| .cse1))))) [2024-12-06 06:29:46,824 INFO L77 FloydHoareUtils]: At program point L546-1(line 546) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|))) (let ((.cse2 (select .cse4 4)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|)) (.cse3 (select .cse4 .cse1))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (select .cse0 .cse1) 0) (= (select |#valid| .cse2) 1) (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (<= (+ .cse3 1) |#StackHeapBarrier|) (= (select |#length| |ULTIMATE.start_main_~#data~0#1.base|) 8) (= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem11#1.base|) |ULTIMATE.start_main_#t~mem11#1.offset|) 4) (= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|)) (= (select (select |#memory_int| .cse2) (select .cse0 4)) 8) (= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1) (<= (+ |ULTIMATE.start_main_#t~mem11#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (store (store (store |#valid| .cse3 0) |ULTIMATE.start_main_#t~mem11#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| .cse3))))) [2024-12-06 06:29:46,824 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,824 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,825 INFO L77 FloydHoareUtils]: At program point L538(line 538) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_free_data_~lo~0#1.base|) |ULTIMATE.start_free_data_~lo~0#1.offset|) 4) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_free_data_~hi~0#1.base|)) (= 8 (select (select |#memory_int| |ULTIMATE.start_free_data_~hi~0#1.base|) |ULTIMATE.start_free_data_~hi~0#1.offset|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-12-06 06:29:46,825 INFO L77 FloydHoareUtils]: At program point L538-1(line 538) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_free_data_~hi~0#1.base|)) (= |ULTIMATE.start_free_data_#t~mem9#1| 4) (= 8 (select (select |#memory_int| |ULTIMATE.start_free_data_~hi~0#1.base|) |ULTIMATE.start_free_data_~hi~0#1.offset|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-12-06 06:29:46,825 INFO L77 FloydHoareUtils]: At program point L538-2(lines 538 539) the Hoare annotation is: (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (= 8 |ULTIMATE.start_free_data_#t~mem10#1|) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (= |ULTIMATE.start_free_data_#t~mem9#1| 4) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-12-06 06:29:46,825 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,826 INFO L77 FloydHoareUtils]: At program point L534(lines 534 542) the Hoare annotation is: (let ((.cse0 (+ |#StackHeapBarrier| 1))) (and (<= .cse0 |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_free_data_#in~data#1.hi.base| 1) |#StackHeapBarrier|) (<= .cse0 |ULTIMATE.start_free_data_~#data#1.base|) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_#in~data#1.hi.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_free_data_#in~data#1.lo.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_free_data_#in~data#1.lo.base|)) (<= (+ |ULTIMATE.start_free_data_#in~data#1.lo.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.lo.base|) 1) (= 4 (select (select |#memory_int| |ULTIMATE.start_free_data_#in~data#1.lo.base|) |ULTIMATE.start_free_data_#in~data#1.lo.offset|)) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| 0) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|) 1) (= |ULTIMATE.start_free_data_#in~data#1.lo.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_free_data_#in~data#1.hi.base|) |ULTIMATE.start_free_data_#in~data#1.hi.offset|) 8) (= (select |#valid| 0) 0) (= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_free_data_#in~data#1.hi.base|)))) [2024-12-06 06:29:46,826 INFO L77 FloydHoareUtils]: At program point L534-1(lines 534 542) the Hoare annotation is: (let ((.cse0 (+ |#StackHeapBarrier| 1)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))) (and (<= .cse0 |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_free_data_#in~data#1.hi.base| 1) |#StackHeapBarrier|) (<= .cse0 |ULTIMATE.start_free_data_~#data#1.base|) (= (select (select |#memory_int| .cse1) .cse2) 4) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (<= 4 (select |#length| .cse1)) (<= (+ .cse1 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| 0) (= .cse2 0) (= (select |#valid| .cse1) 1) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_free_data_#in~data#1.hi.base|) |ULTIMATE.start_free_data_#in~data#1.hi.offset|) 8) (= (select |#valid| 0) 0) (= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_#in~data#1.hi.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) .cse1 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-12-06 06:29:46,827 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,827 INFO L77 FloydHoareUtils]: At program point L534-2(lines 534 542) the Hoare annotation is: (let ((.cse6 (+ |ULTIMATE.start_free_data_~#data#1.offset| 4)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|)) (.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|))) (let ((.cse0 (+ |#StackHeapBarrier| 1)) (.cse2 (select .cse7 |ULTIMATE.start_free_data_~#data#1.offset|)) (.cse1 (select .cse5 |ULTIMATE.start_free_data_~#data#1.offset|)) (.cse3 (select .cse7 .cse6)) (.cse4 (select .cse5 .cse6))) (and (<= .cse0 |ULTIMATE.start_main_~#data~0#1.base|) (<= .cse0 |ULTIMATE.start_free_data_~#data#1.base|) (= (select (select |#memory_int| .cse1) .cse2) 4) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (<= 4 (select |#length| .cse1)) (<= (+ .cse1 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (= .cse3 0) (<= 4 (select |#length| .cse4)) (<= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (<= (+ .cse4 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) .cse4 0) |ULTIMATE.start_main_~#data~0#1.base| 0) .cse1 0)) (= .cse2 0) (= (select |#valid| .cse1) 1) (= (select |#valid| 0) 0) (= (select (select |#memory_int| .cse4) .cse3) 8) (= (select |#valid| .cse4) 1)))) [2024-12-06 06:29:46,827 INFO L77 FloydHoareUtils]: At program point L534-3(lines 534 542) the Hoare annotation is: (= (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) [2024-12-06 06:29:46,827 INFO L77 FloydHoareUtils]: At program point L530(line 530) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|))) (let ((.cse0 (select .cse2 |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (.cse1 (select .cse2 0))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| .cse0) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= 4 (select |#length| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#length| .cse1) 4) (<= (+ |ULTIMATE.start_alloc_data_#t~malloc4#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store (store |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base| 0) .cse1 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= .cse1 |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| 0) 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) 1) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1)))) [2024-12-06 06:29:46,827 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,827 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,827 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-06 06:29:46,827 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE(line 540) no Hoare annotation was computed. [2024-12-06 06:29:46,834 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-06 06:29:46,834 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 06:29:46,835 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-06 06:29:46,835 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-06 06:29:46,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 06:29:46 ImpRootNode [2024-12-06 06:29:46,836 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 06:29:46,836 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 06:29:46,836 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 06:29:46,836 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 06:29:46,837 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:04" (3/4) ... [2024-12-06 06:29:46,839 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 06:29:46,843 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-12-06 06:29:46,844 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-12-06 06:29:46,844 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-06 06:29:46,844 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 06:29:46,908 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 06:29:46,908 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 06:29:46,908 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 06:29:46,909 INFO L158 Benchmark]: Toolchain (without parser) took 283399.87ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 116.3MB in the beginning and 344.8MB in the end (delta: -228.5MB). Peak memory consumption was 405.2MB. Max. memory is 16.1GB. [2024-12-06 06:29:46,909 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:29:46,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.06ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 99.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 06:29:46,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.34ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:29:46,910 INFO L158 Benchmark]: Boogie Preprocessor took 21.56ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:29:46,910 INFO L158 Benchmark]: RCFGBuilder took 374.27ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 76.2MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 06:29:46,911 INFO L158 Benchmark]: CodeCheck took 282609.06ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 76.2MB in the beginning and 348.8MB in the end (delta: -272.7MB). Peak memory consumption was 363.3MB. Max. memory is 16.1GB. [2024-12-06 06:29:46,911 INFO L158 Benchmark]: Witness Printer took 71.99ms. Allocated memory is still 780.1MB. Free memory was 348.8MB in the beginning and 344.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 06:29:46,913 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 60 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 282.1s, OverallIterations: 37, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1425 SdHoareTripleChecker+Valid, 19.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1302 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 17.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 3542 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12267 IncrementalHoareTripleChecker+Invalid, 15809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3542 mSolverCounterUnsat, 53 mSDtfsCounter, 12267 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3487 GetRequests, 2442 SyntacticMatches, 51 SemanticMatches, 994 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455604 ImplicationChecksByTransitivity, 273.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 50.1s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 5332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 540]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 540]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 543]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.06ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 99.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.34ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.56ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 374.27ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 76.2MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 282609.06ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 76.2MB in the beginning and 348.8MB in the end (delta: -272.7MB). Peak memory consumption was 363.3MB. Max. memory is 16.1GB. * Witness Printer took 71.99ms. Allocated memory is still 780.1MB. Free memory was 348.8MB in the beginning and 344.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid RESULT: Ultimate proved your program to be correct! [2024-12-06 06:29:46,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d52fca3-0896-4456-84ce-74026602c47e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE