./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ffd6e9554cad43049f3baa89c0ba2bf94011d3e069a47b1754df8be10679286a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:37:58,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:37:59,056 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-13 20:37:59,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:37:59,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:37:59,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:37:59,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:37:59,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:37:59,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:37:59,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:37:59,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:37:59,103 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 20:37:59,103 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 20:37:59,103 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 20:37:59,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:37:59,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:37:59,103 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 20:37:59,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:37:59,104 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:37:59,104 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:37:59,104 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:37:59,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:37:59,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:37:59,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:37:59,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:37:59,105 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:37:59,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:37:59,107 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_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ffd6e9554cad43049f3baa89c0ba2bf94011d3e069a47b1754df8be10679286a [2024-11-13 20:37:59,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:37:59,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:37:59,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:37:59,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:37:59,482 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:37:59,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i Unable to find full path for "g++" [2024-11-13 20:38:01,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:38:02,315 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:38:02,316 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i [2024-11-13 20:38:02,343 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/data/dc4889df4/882d6cbd3d6b44b0b94d5656a5fd69b0/FLAG5778f5523 [2024-11-13 20:38:02,376 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/data/dc4889df4/882d6cbd3d6b44b0b94d5656a5fd69b0 [2024-11-13 20:38:02,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:38:02,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:38:02,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:38:02,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:38:02,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:38:02,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:38:02" (1/1) ... [2024-11-13 20:38:02,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@401cf5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:02, skipping insertion in model container [2024-11-13 20:38:02,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:38:02" (1/1) ... [2024-11-13 20:38:02,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:38:02,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:38:02,899 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:38:02,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:38:03,020 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:38:03,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03 WrapperNode [2024-11-13 20:38:03,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:38:03,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:38:03,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:38:03,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:38:03,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,067 INFO L138 Inliner]: procedures = 111, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-13 20:38:03,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:38:03,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:38:03,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:38:03,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:38:03,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:38:03,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:38:03,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:38:03,096 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:38:03,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:38:03,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:38:03,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:38:03,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:38:03,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 20:38:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 20:38:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 20:38:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 20:38:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:38:03,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:38:03,318 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:38:03,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:38:03,740 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-13 20:38:03,740 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:38:03,819 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:38:03,820 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:38:03,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:38:03 BoogieIcfgContainer [2024-11-13 20:38:03,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:38:03,821 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:38:03,823 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:38:03,837 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:38:03,838 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:38:03" (1/1) ... [2024-11-13 20:38:03,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:38:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 49 states and 52 transitions. [2024-11-13 20:38:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-13 20:38:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 20:38:03,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:04,501 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-13 20:38:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 48 states and 51 transitions. [2024-11-13 20:38:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2024-11-13 20:38:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 20:38:04,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:04,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:05,046 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-13 20:38:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 47 states and 50 transitions. [2024-11-13 20:38:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-11-13 20:38:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 20:38:05,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:05,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:05,444 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-13 20:38:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 46 states and 49 transitions. [2024-11-13 20:38:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-13 20:38:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 20:38:05,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:05,859 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-13 20:38:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 45 states and 48 transitions. [2024-11-13 20:38:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-13 20:38:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 20:38:06,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 44 states and 47 transitions. [2024-11-13 20:38:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-11-13 20:38:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 20:38:06,884 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:07,057 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-13 20:38:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 43 states and 46 transitions. [2024-11-13 20:38:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-13 20:38:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 20:38:07,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 42 states and 45 transitions. [2024-11-13 20:38:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-13 20:38:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 20:38:08,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:08,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:09,036 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-13 20:38:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2024-11-13 20:38:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-13 20:38:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 20:38:10,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:10,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-13 20:38:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 42 states and 45 transitions. [2024-11-13 20:38:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-13 20:38:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 20:38:11,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:11,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:11,355 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-13 20:38:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 43 states and 48 transitions. [2024-11-13 20:38:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-13 20:38:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:38:12,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:12,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 45 states and 53 transitions. [2024-11-13 20:38:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-11-13 20:38:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:38:13,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:13,632 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-13 20:38:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 47 states and 58 transitions. [2024-11-13 20:38:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-11-13 20:38:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:38:14,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:14,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-13 20:38:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 51 states and 66 transitions. [2024-11-13 20:38:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-13 20:38:15,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:38:15,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:15,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 55 states and 73 transitions. [2024-11-13 20:38:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-11-13 20:38:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 20:38:17,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:17,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:17,127 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-13 20:38:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 60 states and 87 transitions. [2024-11-13 20:38:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-11-13 20:38:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 20:38:18,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:18,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:18,213 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-13 20:38:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 65 states and 101 transitions. [2024-11-13 20:38:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2024-11-13 20:38:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 20:38:19,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:19,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:19,728 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-13 20:38:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 66 states and 102 transitions. [2024-11-13 20:38:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-11-13 20:38:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:38:20,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:20,665 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-13 20:38:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 72 states and 117 transitions. [2024-11-13 20:38:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions. [2024-11-13 20:38:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:38:24,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:24,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:24,726 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-13 20:38:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 76 states and 132 transitions. [2024-11-13 20:38:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2024-11-13 20:38:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:38:26,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:26,586 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-13 20:38:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 81 states and 148 transitions. [2024-11-13 20:38:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 148 transitions. [2024-11-13 20:38:28,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:38:28,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:28,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:28,553 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-13 20:38:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 82 states and 150 transitions. [2024-11-13 20:38:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 150 transitions. [2024-11-13 20:38:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:38:29,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:29,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 83 states and 150 transitions. [2024-11-13 20:38:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2024-11-13 20:38:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:38:29,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:30,185 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-13 20:38:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 87 states and 159 transitions. [2024-11-13 20:38:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2024-11-13 20:38:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:38:33,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:33,578 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-13 20:38:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 89 states and 164 transitions. [2024-11-13 20:38:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 164 transitions. [2024-11-13 20:38:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:38:34,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:34,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:34,800 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-13 20:38:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 96 states and 180 transitions. [2024-11-13 20:38:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 180 transitions. [2024-11-13 20:38:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:38:38,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:38,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:38,860 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-13 20:38:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 98 states and 184 transitions. [2024-11-13 20:38:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2024-11-13 20:38:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:38:39,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:39,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:39,244 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-13 20:38:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 101 states and 189 transitions. [2024-11-13 20:38:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 189 transitions. [2024-11-13 20:38:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:38:39,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:39,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 102 states and 192 transitions. [2024-11-13 20:38:39,529 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 192 transitions. [2024-11-13 20:38:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:38:39,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:39,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:39,567 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-13 20:38:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 104 states and 197 transitions. [2024-11-13 20:38:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 197 transitions. [2024-11-13 20:38:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:38:39,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:39,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:39,644 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-13 20:38:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 103 states and 196 transitions. [2024-11-13 20:38:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 196 transitions. [2024-11-13 20:38:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:38:39,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:39,783 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-13 20:38:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 104 states and 196 transitions. [2024-11-13 20:38:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 196 transitions. [2024-11-13 20:38:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:38:39,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:39,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:39,884 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-13 20:38:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 103 states and 195 transitions. [2024-11-13 20:38:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 195 transitions. [2024-11-13 20:38:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:38:39,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:39,988 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-13 20:38:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 104 states and 203 transitions. [2024-11-13 20:38:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 203 transitions. [2024-11-13 20:38:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 20:38:40,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:40,124 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-13 20:38:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 106 states and 206 transitions. [2024-11-13 20:38:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 206 transitions. [2024-11-13 20:38:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 20:38:40,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:40,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:40,642 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-13 20:38:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 108 states and 207 transitions. [2024-11-13 20:38:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 207 transitions. [2024-11-13 20:38:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:38:40,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:38:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 116 states and 222 transitions. [2024-11-13 20:38:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 222 transitions. [2024-11-13 20:38:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:38:43,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:38:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 122 states and 232 transitions. [2024-11-13 20:38:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 232 transitions. [2024-11-13 20:38:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:38:45,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:38:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 124 states and 234 transitions. [2024-11-13 20:38:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 234 transitions. [2024-11-13 20:38:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 20:38:45,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:38:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 126 states and 235 transitions. [2024-11-13 20:38:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 235 transitions. [2024-11-13 20:38:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 20:38:45,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:45,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:45,355 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-13 20:38:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 125 states and 233 transitions. [2024-11-13 20:38:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 233 transitions. [2024-11-13 20:38:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 20:38:45,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:45,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:45,470 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-13 20:38:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 127 states and 235 transitions. [2024-11-13 20:38:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 235 transitions. [2024-11-13 20:38:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:38:45,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:45,579 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-13 20:38:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 132 states and 241 transitions. [2024-11-13 20:38:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 241 transitions. [2024-11-13 20:38:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:38:46,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:46,239 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-13 20:38:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 137 states and 247 transitions. [2024-11-13 20:38:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 247 transitions. [2024-11-13 20:38:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:38:46,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:46,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:47,002 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-13 20:38:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 139 states and 250 transitions. [2024-11-13 20:38:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 250 transitions. [2024-11-13 20:38:47,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 20:38:47,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:47,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:47,713 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-13 20:38:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 141 states and 251 transitions. [2024-11-13 20:38:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 251 transitions. [2024-11-13 20:38:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:38:47,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:47,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:38:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:38:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 147 states and 260 transitions. [2024-11-13 20:38:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 260 transitions. [2024-11-13 20:38:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:38:55,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:38:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:38:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:38:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:39:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 160 states and 288 transitions. [2024-11-13 20:39:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 288 transitions. [2024-11-13 20:39:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:39:12,442 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:12,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 20:39:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 161 states and 290 transitions. [2024-11-13 20:39:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 290 transitions. [2024-11-13 20:39:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:39:13,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 20:39:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 162 states and 292 transitions. [2024-11-13 20:39:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 292 transitions. [2024-11-13 20:39:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:39:13,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:39:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 163 states and 293 transitions. [2024-11-13 20:39:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 293 transitions. [2024-11-13 20:39:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 20:39:15,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:39:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 165 states and 295 transitions. [2024-11-13 20:39:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 295 transitions. [2024-11-13 20:39:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:39:17,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:17,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 20:39:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 167 states and 299 transitions. [2024-11-13 20:39:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 299 transitions. [2024-11-13 20:39:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:39:19,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:39:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:39:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 174 states and 319 transitions. [2024-11-13 20:39:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 319 transitions. [2024-11-13 20:39:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 20:39:37,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:39:37,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:39:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:39:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:40:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 188 states and 355 transitions. [2024-11-13 20:40:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 355 transitions. [2024-11-13 20:40:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 20:40:23,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:23,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 20:40:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 183 states and 345 transitions. [2024-11-13 20:40:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 345 transitions. [2024-11-13 20:40:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 20:40:24,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 20:40:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 184 states and 345 transitions. [2024-11-13 20:40:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 345 transitions. [2024-11-13 20:40:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 20:40:24,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:40:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 182 states and 342 transitions. [2024-11-13 20:40:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 342 transitions. [2024-11-13 20:40:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 20:40:25,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:25,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:40:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 188 states and 352 transitions. [2024-11-13 20:40:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 352 transitions. [2024-11-13 20:40:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 20:40:32,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:32,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:40:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 187 states and 351 transitions. [2024-11-13 20:40:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 351 transitions. [2024-11-13 20:40:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 20:40:32,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 20:40:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 189 states and 353 transitions. [2024-11-13 20:40:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 353 transitions. [2024-11-13 20:40:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 20:40:34,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 20:40:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 189 states and 352 transitions. [2024-11-13 20:40:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 352 transitions. [2024-11-13 20:40:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 20:40:34,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:34,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:40:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 190 states and 355 transitions. [2024-11-13 20:40:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 355 transitions. [2024-11-13 20:40:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 20:40:37,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:37,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:40:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 192 states and 359 transitions. [2024-11-13 20:40:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 359 transitions. [2024-11-13 20:40:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 20:40:40,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 20:40:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 197 states and 370 transitions. [2024-11-13 20:40:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 370 transitions. [2024-11-13 20:40:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 20:40:44,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:44,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 20:40:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 203 states and 382 transitions. [2024-11-13 20:40:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 382 transitions. [2024-11-13 20:40:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 20:40:49,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:49,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:40:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 205 states and 385 transitions. [2024-11-13 20:40:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 385 transitions. [2024-11-13 20:40:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 20:40:50,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:40:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 207 states and 386 transitions. [2024-11-13 20:40:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 386 transitions. [2024-11-13 20:40:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 20:40:51,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 20:40:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 208 states and 388 transitions. [2024-11-13 20:40:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 388 transitions. [2024-11-13 20:40:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 20:40:53,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:53,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 20:40:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 208 states and 386 transitions. [2024-11-13 20:40:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 386 transitions. [2024-11-13 20:40:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 20:40:54,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:54,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:40:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 211 states and 391 transitions. [2024-11-13 20:40:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 391 transitions. [2024-11-13 20:40:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 20:40:56,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:56,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:40:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 214 states and 394 transitions. [2024-11-13 20:40:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 394 transitions. [2024-11-13 20:40:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 20:40:57,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:57,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 20:40:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 216 states and 396 transitions. [2024-11-13 20:40:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 396 transitions. [2024-11-13 20:40:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 20:40:58,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:58,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 20:40:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:40:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 218 states and 397 transitions. [2024-11-13 20:40:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 397 transitions. [2024-11-13 20:40:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 20:40:59,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:40:59,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:40:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:40:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 20:41:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 227 states and 412 transitions. [2024-11-13 20:41:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 412 transitions. [2024-11-13 20:41:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 20:41:13,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:13,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 20:41:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 235 states and 420 transitions. [2024-11-13 20:41:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 420 transitions. [2024-11-13 20:41:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 20:41:30,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:30,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 20:41:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:41:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 242 states and 430 transitions. [2024-11-13 20:41:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 430 transitions. [2024-11-13 20:41:40,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 20:41:40,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:41:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:41:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:41:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:42:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:42:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 253 states and 461 transitions. [2024-11-13 20:42:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 461 transitions. [2024-11-13 20:42:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 20:42:31,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:42:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:42:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:42:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 20:42:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:42:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 255 states and 464 transitions. [2024-11-13 20:42:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 464 transitions. [2024-11-13 20:42:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 20:42:35,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:42:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:42:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:42:35,206 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 20:42:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:42:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 255 states and 462 transitions. [2024-11-13 20:42:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 462 transitions. [2024-11-13 20:42:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 20:42:37,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:42:37,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:42:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:42:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:43:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:43:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 275 states and 512 transitions. [2024-11-13 20:43:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 512 transitions. [2024-11-13 20:43:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 20:43:56,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:43:56,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:43:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:43:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 20:44:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:44:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 285 states and 523 transitions. [2024-11-13 20:44:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 523 transitions. [2024-11-13 20:44:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-13 20:44:23,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:44:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:44:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:44:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:45:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:45:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 43 states and 55 transitions. [2024-11-13 20:45:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-13 20:45:10,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 20:45:10,459 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 83 iterations. [2024-11-13 20:45:10,475 INFO L729 CodeCheckObserver]: All specifications hold 29 specifications checked. All of them hold [2024-11-13 20:45:22,672 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,673 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,673 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,673 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,673 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,673 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,673 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,673 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,673 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 566 568) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 20:45:22,674 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,674 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,674 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,674 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,674 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,674 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,675 INFO L77 FloydHoareUtils]: At program point L561(line 561) the Hoare annotation is: (let ((.cse22 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse9 (select .cse22 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse10 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse6 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse8 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse12 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse14 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse15 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse16 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse9)) (.cse17 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse18 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse19 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse20 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1) .cse9) .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (or .cse10 (= (select .cse22 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0))) .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))))) [2024-11-13 20:45:22,676 INFO L77 FloydHoareUtils]: At program point L561-1(line 561) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse24 (select .cse7 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse23 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse5 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse8 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse9 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse10 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse11 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse12 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_test_fun_#t~mem13#1| .cse23)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse16 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse17 (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse24)) (.cse18 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse19 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse20 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse22 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (or .cse6 (= (select .cse7 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 (or (<= (+ .cse23 1) .cse24) .cse6) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))))) [2024-11-13 20:45:22,676 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,676 INFO L77 FloydHoareUtils]: At program point L557(line 557) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:45:22,677 INFO L77 FloydHoareUtils]: At program point L557-2(line 557) the Hoare annotation is: (and (or (not |ULTIMATE.start_test_fun_#t~short9#1|) (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:45:22,677 INFO L77 FloydHoareUtils]: At program point L557-3(line 557) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:45:22,678 INFO L77 FloydHoareUtils]: At program point L553(line 553) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (= (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 4) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-11-13 20:45:22,679 INFO L77 FloydHoareUtils]: At program point L553-1(line 553) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-11-13 20:45:22,679 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK(lines 566 568) no Hoare annotation was computed. [2024-11-13 20:45:22,680 INFO L77 FloydHoareUtils]: At program point L557-6(lines 557 563) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse5 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse8 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not |ULTIMATE.start_test_fun_#t~short9#1|) .cse6 .cse7 .cse8 .cse9) (let ((.cse11 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))) (and .cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) .cse1 .cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (let ((.cse10 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (or (< .cse10 2147483647) (< .cse10 .cse11))) .cse3 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) .cse4 .cse5 (= |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|)) (<= .cse11 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse6 .cse7 .cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) .cse9)))) [2024-11-13 20:45:22,680 INFO L77 FloydHoareUtils]: At program point L557-8(lines 557 563) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:45:22,680 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 20:45:22,680 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,680 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,681 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,681 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,681 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,681 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,682 INFO L77 FloydHoareUtils]: At program point L558(line 558) the Hoare annotation is: (let ((.cse1 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (or (<= .cse0 2147483646) (< .cse0 .cse1))) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 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|)) (<= .cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) [2024-11-13 20:45:22,682 INFO L77 FloydHoareUtils]: At program point L558-1(line 558) the Hoare annotation is: (let ((.cse27 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse23 (+ |ULTIMATE.start_test_fun_#t~mem10#1| 1)) (.cse8 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse26 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse24 (select .cse8 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse25 (< .cse27 .cse23))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse4 (or .cse25 (<= .cse27 2147483646))) (.cse5 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse6 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse13 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse16 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse17 (<= (+ .cse26 1) .cse24)) (.cse18 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse19 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse20 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse22 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (or .cse7 (= (select .cse8 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (or (<= .cse23 .cse24) .cse7) .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (or .cse25 (<= .cse26 |ULTIMATE.start_test_fun_#t~mem10#1|))))))) [2024-11-13 20:45:22,683 INFO L77 FloydHoareUtils]: At program point L558-2(lines 558 562) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse27 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse25 (select .cse8 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse26 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse2 (or (<= .cse26 |ULTIMATE.start_test_fun_#t~mem10#1|) (<= .cse26 2147483646))) (.cse3 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse7 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse4 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse5 (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1)) (.cse6 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse9 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse10 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse11 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse12 (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse13 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse15 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse16 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse17 (<= (+ .cse27 1) .cse25)) (.cse18 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|))) (.cse19 (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|))) (.cse20 (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse21 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (.cse22 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse23 (= |ULTIMATE.start_test_fun_#t~mem11#1| .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (or .cse7 (= (select .cse8 |ULTIMATE.start_test_fun_~c~0#1.offset|) 0))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse24 (+ |ULTIMATE.start_test_fun_#t~mem10#1| 1))) (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) .cse2 .cse3 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (or (<= .cse24 .cse25) .cse7) .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (or (< .cse26 .cse24) (<= .cse27 |ULTIMATE.start_test_fun_#t~mem10#1|)) .cse23)))))) [2024-11-13 20:45:22,684 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-11-13 20:45:22,684 INFO L77 FloydHoareUtils]: At program point L558-4(lines 557 563) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:45:22,684 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 20:45:22,685 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,685 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,685 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,685 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,685 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,685 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,686 INFO L77 FloydHoareUtils]: At program point L559(line 559) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483646) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:45:22,686 INFO L77 FloydHoareUtils]: At program point L559-1(line 559) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483646) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|))) [2024-11-13 20:45:22,687 INFO L77 FloydHoareUtils]: At program point L555(line 555) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_test_fun_~c~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 1) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_#t~malloc4#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~c~0#1.base|) 4) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc5#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) [2024-11-13 20:45:22,687 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:45:22,697 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 20:45:22,698 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 20:45:22,700 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:45:22,700 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:45:22,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 20:45:22,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 20:45:22,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 20:45:22,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 20:45:22,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 20:45:22,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 20:45:22,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-13 20:45:22,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 20:45:22,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 20:45:22,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 20:45:22,704 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 20:45:22,704 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 20:45:22,704 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 20:45:22,704 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:45:22,704 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:45:22,705 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 20:45:22,705 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:45:22,706 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 20:45:22,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 20:45:22,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:45:22,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:45:22,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:45:22,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:45:22,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 20:45:22,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 20:45:22,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-11-13 20:45:22,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!base [2024-11-13 20:45:22,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 20:45:22,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 20:45:22,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:45:22,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:45:22,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-13 20:45:22,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-11-13 20:45:22,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-13 20:45:22,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!base [2024-11-13 20:45:22,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-13 20:45:22,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~c~0!offset [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 20:45:22,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc4!base [2024-11-13 20:45:22,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc5!base [2024-11-13 20:45:22,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 20:45:22,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 20:45:22,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 20:45:22,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:45:22,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:45:22,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 20:45:22,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 20:45:22,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:45:22 ImpRootNode [2024-11-13 20:45:22,713 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:45:22,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:45:22,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:45:22,714 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:45:22,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:38:03" (3/4) ... [2024-11-13 20:45:22,719 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 20:45:22,728 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-13 20:45:22,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 20:45:22,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 20:45:22,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 20:45:22,838 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:45:22,839 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 20:45:22,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:45:22,840 INFO L158 Benchmark]: Toolchain (without parser) took 440454.69ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 106.8MB in the beginning and 598.8MB in the end (delta: -492.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-13 20:45:22,840 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 167.8MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:45:22,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.85ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 90.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:45:22,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.55ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:45:22,843 INFO L158 Benchmark]: Boogie Preprocessor took 27.06ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 87.7MB in the end (delta: 984.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:45:22,843 INFO L158 Benchmark]: RCFGBuilder took 724.87ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 68.3MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:45:22,845 INFO L158 Benchmark]: CodeCheck took 438891.79ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 68.3MB in the beginning and 607.2MB in the end (delta: -538.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-13 20:45:22,848 INFO L158 Benchmark]: Witness Printer took 124.76ms. Allocated memory is still 1.7GB. Free memory was 607.2MB in the beginning and 598.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:45:22,850 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 49 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 426.6s, OverallIterations: 83, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31272 SdHoareTripleChecker+Valid, 165.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30374 mSDsluCounter, 14449 SdHoareTripleChecker+Invalid, 148.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12841 mSDsCounter, 6873 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72096 IncrementalHoareTripleChecker+Invalid, 78969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6873 mSolverCounterUnsat, 1608 mSDtfsCounter, 72096 mSolverCounterSat, 2.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15698 GetRequests, 13918 SyntacticMatches, 644 SemanticMatches, 1136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735490 ImplicationChecksByTransitivity, 403.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 53.8s InterpolantComputationTime, 1561 NumberOfCodeBlocks, 1561 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 1479 ConstructedInterpolants, 0 QuantifiedInterpolants, 21982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 82 InterpolantComputations, 73 PerfectInterpolantSequences, 515/599 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: 566]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.93ms. Allocated memory is still 167.8MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.85ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 90.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.55ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.06ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 87.7MB in the end (delta: 984.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 724.87ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 68.3MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 438891.79ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 68.3MB in the beginning and 607.2MB in the end (delta: -538.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 124.76ms. Allocated memory is still 1.7GB. Free memory was 607.2MB in the beginning and 598.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~z_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~c~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc4!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc5!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] RESULT: Ultimate proved your program to be correct! [2024-11-13 20:45:22,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9628c255-e303-48df-a963-38cd0f4d5ca2/bin/ukojak-verify-EEHR8qb7sm/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