./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1dfda05d3675e1795581ea2bc298236cc0d085a96432f97caff9d055d75a6052 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:18:39,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:18:39,483 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-09 00:18:39,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:18:39,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:18:39,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:18:39,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:18:39,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:18:39,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:18:39,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:18:39,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:18:39,516 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 00:18:39,516 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 00:18:39,517 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 00:18:39,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:18:39,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:18:39,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 00:18:39,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:18:39,520 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:18:39,520 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:18:39,520 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:18:39,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:18:39,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:18:39,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:18:39,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:18:39,526 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:18:39,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:18:39,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1dfda05d3675e1795581ea2bc298236cc0d085a96432f97caff9d055d75a6052 [2024-11-09 00:18:39,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:18:39,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:18:39,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:18:39,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:18:39,897 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:18:39,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca.i Unable to find full path for "g++" [2024-11-09 00:18:41,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:18:42,214 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:18:42,215 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca.i [2024-11-09 00:18:42,231 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/data/8eb83cc8d/bfa3b7672f344f22bbe09230f8eaa6c3/FLAGe461e6afc [2024-11-09 00:18:42,512 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/data/8eb83cc8d/bfa3b7672f344f22bbe09230f8eaa6c3 [2024-11-09 00:18:42,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:18:42,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:18:42,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:18:42,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:18:42,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:18:42,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:18:42" (1/1) ... [2024-11-09 00:18:42,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747cd433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:42, skipping insertion in model container [2024-11-09 00:18:42,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:18:42" (1/1) ... [2024-11-09 00:18:42,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:18:42,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:18:42,935 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:18:42,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:18:43,017 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:18:43,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43 WrapperNode [2024-11-09 00:18:43,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:18:43,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:18:43,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:18:43,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:18:43,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,068 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-11-09 00:18:43,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:18:43,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:18:43,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:18:43,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:18:43,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:18:43,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:18:43,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:18:43,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:18:43,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:18:43,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:18:43,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:18:43,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:18:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 00:18:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 00:18:43,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 00:18:43,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 00:18:43,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:18:43,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:18:43,302 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:18:43,311 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:18:43,662 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-09 00:18:43,662 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:18:43,703 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:18:43,704 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:18:43,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:18:43 BoogieIcfgContainer [2024-11-09 00:18:43,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:18:43,705 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:18:43,705 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:18:43,716 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:18:43,716 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:18:43" (1/1) ... [2024-11-09 00:18:43,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:18:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 51 states and 55 transitions. [2024-11-09 00:18:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-11-09 00:18:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:18:43,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:43,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:44,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 50 states and 54 transitions. [2024-11-09 00:18:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-11-09 00:18:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 00:18:44,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:44,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 49 states and 53 transitions. [2024-11-09 00:18:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-11-09 00:18:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:18:44,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 48 states and 52 transitions. [2024-11-09 00:18:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2024-11-09 00:18:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 00:18:44,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 47 states and 51 transitions. [2024-11-09 00:18:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-11-09 00:18:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:18:45,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:45,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 46 states and 50 transitions. [2024-11-09 00:18:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-11-09 00:18:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 00:18:45,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:45,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 45 states and 49 transitions. [2024-11-09 00:18:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-11-09 00:18:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 00:18:45,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 46 states and 50 transitions. [2024-11-09 00:18:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-11-09 00:18:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 00:18:45,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 47 states and 52 transitions. [2024-11-09 00:18:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-09 00:18:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 00:18:45,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 46 states and 51 transitions. [2024-11-09 00:18:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-11-09 00:18:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 00:18:45,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:45,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 45 states and 50 transitions. [2024-11-09 00:18:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-09 00:18:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:18:45,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:45,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 46 states and 52 transitions. [2024-11-09 00:18:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-09 00:18:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:18:46,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:46,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 48 states and 56 transitions. [2024-11-09 00:18:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-09 00:18:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 00:18:46,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 50 states and 59 transitions. [2024-11-09 00:18:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-11-09 00:18:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:18:46,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:46,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 49 states and 58 transitions. [2024-11-09 00:18:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-11-09 00:18:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:18:46,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:46,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 51 states and 61 transitions. [2024-11-09 00:18:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2024-11-09 00:18:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:18:46,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 52 states and 63 transitions. [2024-11-09 00:18:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2024-11-09 00:18:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:18:46,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 56 states and 69 transitions. [2024-11-09 00:18:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2024-11-09 00:18:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:18:47,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:47,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 57 states and 71 transitions. [2024-11-09 00:18:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2024-11-09 00:18:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:18:47,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 59 states and 75 transitions. [2024-11-09 00:18:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-11-09 00:18:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:18:47,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 61 states and 80 transitions. [2024-11-09 00:18:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-11-09 00:18:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:18:47,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:47,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 62 states and 82 transitions. [2024-11-09 00:18:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-11-09 00:18:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:18:47,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 61 states and 81 transitions. [2024-11-09 00:18:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2024-11-09 00:18:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:18:47,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 61 states and 80 transitions. [2024-11-09 00:18:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-11-09 00:18:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:18:48,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:48,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 63 states and 82 transitions. [2024-11-09 00:18:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-11-09 00:18:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:18:48,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 68 states and 92 transitions. [2024-11-09 00:18:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-11-09 00:18:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:18:48,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:48,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 72 states and 99 transitions. [2024-11-09 00:18:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2024-11-09 00:18:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:18:48,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 74 states and 101 transitions. [2024-11-09 00:18:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2024-11-09 00:18:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:18:49,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:49,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 78 states and 108 transitions. [2024-11-09 00:18:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-11-09 00:18:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:18:49,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:49,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 79 states and 109 transitions. [2024-11-09 00:18:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-11-09 00:18:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:18:49,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 80 states and 110 transitions. [2024-11-09 00:18:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-11-09 00:18:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:18:49,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:49,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 81 states and 112 transitions. [2024-11-09 00:18:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2024-11-09 00:18:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:18:49,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 84 states and 117 transitions. [2024-11-09 00:18:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 117 transitions. [2024-11-09 00:18:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:18:49,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 92 states and 128 transitions. [2024-11-09 00:18:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-11-09 00:18:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:18:51,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 93 states and 130 transitions. [2024-11-09 00:18:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-09 00:18:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:18:51,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:51,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:18:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 95 states and 134 transitions. [2024-11-09 00:18:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2024-11-09 00:18:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:18:51,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:18:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 44 states and 54 transitions. [2024-11-09 00:18:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-11-09 00:18:51,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:18:51,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:51,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 00:18:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 41 states and 51 transitions. [2024-11-09 00:18:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-11-09 00:18:51,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:18:51,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:51,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 00:18:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 34 states and 39 transitions. [2024-11-09 00:18:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-09 00:18:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 00:18:53,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:18:53,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:18:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:18:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:18:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:18:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 22 states and 24 transitions. [2024-11-09 00:18:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-09 00:18:56,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:18:56,378 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 40 iterations. [2024-11-09 00:18:56,390 INFO L729 CodeCheckObserver]: All specifications hold 29 specifications checked. All of them hold [2024-11-09 00:18:56,882 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,882 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,882 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,882 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,883 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,883 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,883 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,883 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,884 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,884 INFO L77 FloydHoareUtils]: At program point L560-2(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,884 INFO L77 FloydHoareUtils]: At program point L556-1(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,884 INFO L77 FloydHoareUtils]: At program point L556-3(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,885 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,885 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 564 566) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-09 00:18:56,885 INFO L77 FloydHoareUtils]: At program point L552(line 552) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,885 INFO L77 FloydHoareUtils]: At program point L556-4(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,885 INFO L77 FloydHoareUtils]: At program point L556-5(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,886 INFO L77 FloydHoareUtils]: At program point L556-8(lines 556 561) the Hoare annotation is: (let ((.cse0 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse4 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse0 .cse1 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) .cse2 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse3 .cse4) (and (not |ULTIMATE.start_test_fun_#t~short10#1|) .cse0 .cse1 .cse2 .cse3 .cse4))) [2024-11-09 00:18:56,886 INFO L77 FloydHoareUtils]: At program point L556-10(lines 556 561) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,886 INFO L77 FloydHoareUtils]: At program point L556-11(lines 556 561) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,886 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,886 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,887 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,887 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,887 INFO L77 FloydHoareUtils]: At program point L557-1(lines 557 559) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 1 |ULTIMATE.start_test_fun_#t~mem11#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,888 INFO L77 FloydHoareUtils]: At program point L553(lines 553 555) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,888 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK(lines 564 566) no Hoare annotation was computed. [2024-11-09 00:18:56,888 INFO L77 FloydHoareUtils]: At program point test_fun_returnLabel#1(lines 547 563) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-09 00:18:56,888 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:18:56,888 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,888 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,889 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,889 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,889 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,889 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,889 INFO L75 FloydHoareUtils]: For program point L558(line 558) no Hoare annotation was computed. [2024-11-09 00:18:56,889 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,889 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:18:56,889 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,890 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,890 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,890 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,890 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,890 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,890 INFO L77 FloydHoareUtils]: At program point L551(line 551) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,891 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-09 00:18:56,891 INFO L77 FloydHoareUtils]: At program point L551-1(line 551) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-09 00:18:56,900 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:18:56,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:18:56,902 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-09 00:18:56,902 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 00:18:56,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:18:56 ImpRootNode [2024-11-09 00:18:56,904 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:18:56,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:18:56,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:18:56,905 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:18:56,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:18:43" (3/4) ... [2024-11-09 00:18:56,908 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:18:56,915 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-09 00:18:56,915 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:18:56,916 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 00:18:56,916 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:18:57,007 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:18:57,007 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:18:57,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:18:57,008 INFO L158 Benchmark]: Toolchain (without parser) took 14489.53ms. Allocated memory was 178.3MB in the beginning and 228.6MB in the end (delta: 50.3MB). Free memory was 131.2MB in the beginning and 114.0MB in the end (delta: 17.2MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2024-11-09 00:18:57,008 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 178.3MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:18:57,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.79ms. Allocated memory is still 178.3MB. Free memory was 131.2MB in the beginning and 113.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:18:57,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.23ms. Allocated memory is still 178.3MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:18:57,010 INFO L158 Benchmark]: Boogie Preprocessor took 43.22ms. Allocated memory is still 178.3MB. Free memory was 110.9MB in the beginning and 109.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:18:57,010 INFO L158 Benchmark]: RCFGBuilder took 590.98ms. Allocated memory is still 178.3MB. Free memory was 109.5MB in the beginning and 90.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:18:57,011 INFO L158 Benchmark]: CodeCheck took 13199.03ms. Allocated memory was 178.3MB in the beginning and 228.6MB in the end (delta: 50.3MB). Free memory was 89.9MB in the beginning and 119.3MB in the end (delta: -29.3MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-11-09 00:18:57,011 INFO L158 Benchmark]: Witness Printer took 102.83ms. Allocated memory is still 228.6MB. Free memory was 119.3MB in the beginning and 114.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:18:57,013 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, 51 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 40, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3958 SdHoareTripleChecker+Valid, 15.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3607 mSDsluCounter, 2604 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1898 mSDsCounter, 1526 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8821 IncrementalHoareTripleChecker+Invalid, 10347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1526 mSolverCounterUnsat, 706 mSDtfsCounter, 8821 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3307 GetRequests, 3033 SyntacticMatches, 120 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9378 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 385 ConstructedInterpolants, 0 QuantifiedInterpolants, 2732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 38 PerfectInterpolantSequences, 13/14 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 178.3MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.79ms. Allocated memory is still 178.3MB. Free memory was 131.2MB in the beginning and 113.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.23ms. Allocated memory is still 178.3MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.22ms. Allocated memory is still 178.3MB. Free memory was 110.9MB in the beginning and 109.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 590.98ms. Allocated memory is still 178.3MB. Free memory was 109.5MB in the beginning and 90.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * CodeCheck took 13199.03ms. Allocated memory was 178.3MB in the beginning and 228.6MB in the end (delta: 50.3MB). Free memory was 89.9MB in the beginning and 119.3MB in the end (delta: -29.3MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * Witness Printer took 102.83ms. Allocated memory is still 228.6MB. Free memory was 119.3MB in the beginning and 114.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid RESULT: Ultimate proved your program to be correct! [2024-11-09 00:18:57,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5056e81a-4772-4870-a790-1eef6e8eaabd/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE