./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.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_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/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_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/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_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/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 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:08:47,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:08:47,899 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-64bit-Kojak_Default.epf [2024-11-13 21:08:47,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:08:47,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:08:47,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:08:47,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:08:47,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:08:47,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:08:47,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:08:47,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:08:47,935 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 21:08:47,935 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 21:08:47,935 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 21:08:47,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:08:47,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:08:47,936 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 21:08:47,936 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:08:47,936 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:08:47,936 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:08:47,936 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:08:47,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:08:47,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:08:47,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:08:47,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:08:47,937 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:08:47,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:08:47,937 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_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/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 -> 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff [2024-11-13 21:08:48,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:08:48,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:08:48,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:08:48,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:08:48,377 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:08:48,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i Unable to find full path for "g++" [2024-11-13 21:08:50,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:08:51,133 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:08:51,134 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2024-11-13 21:08:51,149 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/data/8cbc4400e/8a02afdfd059450da086fcdb4127285d/FLAG9b04dfa92 [2024-11-13 21:08:51,348 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/data/8cbc4400e/8a02afdfd059450da086fcdb4127285d [2024-11-13 21:08:51,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:08:51,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:08:51,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:08:51,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:08:51,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:08:51,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce86b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51, skipping insertion in model container [2024-11-13 21:08:51,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:08:51,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:08:51,819 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:08:51,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:08:51,894 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:08:51,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51 WrapperNode [2024-11-13 21:08:51,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:08:51,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:08:51,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:08:51,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:08:51,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,946 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-11-13 21:08:51,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:08:51,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:08:51,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:08:51,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:08:51,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:51,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:08:52,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:08:52,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:08:52,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:08:52,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:08:51" (1/1) ... [2024-11-13 21:08:52,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:08:52,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:08:52,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:08:52,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:08:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 21:08:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 21:08:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 21:08:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 21:08:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:08:52,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:08:52,258 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:08:52,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:08:52,725 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-13 21:08:52,725 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:08:52,823 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:08:52,823 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 21:08:52,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:08:52 BoogieIcfgContainer [2024-11-13 21:08:52,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:08:52,825 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:08:52,826 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:08:52,839 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:08:52,839 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:08:52" (1/1) ... [2024-11-13 21:08:52,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:08:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 60 states and 69 transitions. [2024-11-13 21:08:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-13 21:08:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 21:08:52,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:53,183 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 21:08:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 59 states and 68 transitions. [2024-11-13 21:08:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-11-13 21:08:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 21:08:53,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:53,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:53,431 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 21:08:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 58 states and 67 transitions. [2024-11-13 21:08:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-11-13 21:08:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 21:08:53,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:53,840 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 21:08:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 57 states and 66 transitions. [2024-11-13 21:08:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-11-13 21:08:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 21:08:54,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:54,212 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 21:08:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 56 states and 65 transitions. [2024-11-13 21:08:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-13 21:08:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 21:08:54,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:54,625 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 21:08:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 57 states and 65 transitions. [2024-11-13 21:08:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2024-11-13 21:08:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 21:08:54,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:54,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:54,868 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 21:08:55,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 58 states and 68 transitions. [2024-11-13 21:08:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-11-13 21:08:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:08:55,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:55,090 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 21:08:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 61 states and 75 transitions. [2024-11-13 21:08:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2024-11-13 21:08:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:08:55,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:55,295 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 21:08:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 64 states and 82 transitions. [2024-11-13 21:08:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-11-13 21:08:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:08:55,736 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:55,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:55,765 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 21:08:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 66 states and 89 transitions. [2024-11-13 21:08:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2024-11-13 21:08:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:08:55,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:55,984 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 21:08:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 69 states and 98 transitions. [2024-11-13 21:08:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2024-11-13 21:08:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:08:56,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:56,149 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 21:08:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 70 states and 100 transitions. [2024-11-13 21:08:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2024-11-13 21:08:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:08:56,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:56,392 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 21:08:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 70 states and 99 transitions. [2024-11-13 21:08:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2024-11-13 21:08:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:08:56,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:56,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:56,465 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 21:08:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 71 states and 99 transitions. [2024-11-13 21:08:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-11-13 21:08:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:08:56,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:56,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:56,522 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 21:08:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 72 states and 100 transitions. [2024-11-13 21:08:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-11-13 21:08:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:08:56,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:56,609 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 21:08:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 73 states and 101 transitions. [2024-11-13 21:08:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-13 21:08:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:08:56,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:56,678 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 21:08:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 74 states and 103 transitions. [2024-11-13 21:08:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-11-13 21:08:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:08:56,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:56,973 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 21:08:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 77 states and 107 transitions. [2024-11-13 21:08:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2024-11-13 21:08:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:08:57,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:57,285 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 21:08:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 81 states and 115 transitions. [2024-11-13 21:08:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-13 21:08:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:08:57,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:57,785 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 21:08:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 85 states and 120 transitions. [2024-11-13 21:08:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2024-11-13 21:08:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:08:58,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:58,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:58,243 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 21:08:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 87 states and 127 transitions. [2024-11-13 21:08:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2024-11-13 21:08:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:08:58,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:58,342 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 21:08:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 90 states and 136 transitions. [2024-11-13 21:08:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2024-11-13 21:08:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:08:58,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:58,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:08:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 92 states and 140 transitions. [2024-11-13 21:08:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 140 transitions. [2024-11-13 21:08:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:08:58,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:58,517 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 21:08:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 95 states and 146 transitions. [2024-11-13 21:08:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2024-11-13 21:08:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:08:58,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:58,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:58,604 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 21:08:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 96 states and 149 transitions. [2024-11-13 21:08:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 149 transitions. [2024-11-13 21:08:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:08:58,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:58,690 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 21:08:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 98 states and 155 transitions. [2024-11-13 21:08:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2024-11-13 21:08:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:08:58,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:58,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:58,808 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 21:08:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 99 states and 157 transitions. [2024-11-13 21:08:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 157 transitions. [2024-11-13 21:08:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:08:59,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:59,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:59,134 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 21:08:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 102 states and 162 transitions. [2024-11-13 21:08:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 162 transitions. [2024-11-13 21:08:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:08:59,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:59,417 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 21:08:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 105 states and 166 transitions. [2024-11-13 21:08:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 166 transitions. [2024-11-13 21:08:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:08:59,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:59,739 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 21:08:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:08:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 106 states and 167 transitions. [2024-11-13 21:08:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-11-13 21:08:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:08:59,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:08:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:08:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:08:59,997 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 21:09:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 106 states and 166 transitions. [2024-11-13 21:09:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 166 transitions. [2024-11-13 21:09:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:09:00,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:00,404 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 21:09:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 115 states and 186 transitions. [2024-11-13 21:09:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 186 transitions. [2024-11-13 21:09:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:09:01,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:01,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:09:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 116 states and 188 transitions. [2024-11-13 21:09:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 188 transitions. [2024-11-13 21:09:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:09:01,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:01,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:02,139 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 21:09:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 120 states and 196 transitions. [2024-11-13 21:09:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 196 transitions. [2024-11-13 21:09:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:09:04,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:04,188 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 21:09:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 120 states and 195 transitions. [2024-11-13 21:09:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 195 transitions. [2024-11-13 21:09:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:09:04,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:04,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:04,333 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 21:09:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 121 states and 197 transitions. [2024-11-13 21:09:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 197 transitions. [2024-11-13 21:09:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:09:04,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:04,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:04,393 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 21:09:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 122 states and 198 transitions. [2024-11-13 21:09:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 198 transitions. [2024-11-13 21:09:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:09:04,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:04,474 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 21:09:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 124 states and 204 transitions. [2024-11-13 21:09:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 204 transitions. [2024-11-13 21:09:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:09:04,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:04,533 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 21:09:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 126 states and 208 transitions. [2024-11-13 21:09:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 208 transitions. [2024-11-13 21:09:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:09:04,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:04,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:04,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 21:09:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 127 states and 210 transitions. [2024-11-13 21:09:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 210 transitions. [2024-11-13 21:09:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:09:04,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:04,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 129 states and 214 transitions. [2024-11-13 21:09:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 214 transitions. [2024-11-13 21:09:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:09:04,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:04,785 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 21:09:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 132 states and 218 transitions. [2024-11-13 21:09:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 218 transitions. [2024-11-13 21:09:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:09:05,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:05,451 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 21:09:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 133 states and 219 transitions. [2024-11-13 21:09:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 219 transitions. [2024-11-13 21:09:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:09:05,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:05,729 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 21:09:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 132 states and 218 transitions. [2024-11-13 21:09:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 218 transitions. [2024-11-13 21:09:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:09:05,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:05,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:05,795 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 21:09:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 133 states and 218 transitions. [2024-11-13 21:09:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 218 transitions. [2024-11-13 21:09:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:09:05,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:05,849 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 21:09:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 132 states and 217 transitions. [2024-11-13 21:09:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 217 transitions. [2024-11-13 21:09:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:09:05,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:05,914 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 21:09:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 133 states and 217 transitions. [2024-11-13 21:09:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 217 transitions. [2024-11-13 21:09:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:09:05,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:05,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:09:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 135 states and 221 transitions. [2024-11-13 21:09:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 221 transitions. [2024-11-13 21:09:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:09:06,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:09:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 137 states and 224 transitions. [2024-11-13 21:09:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 224 transitions. [2024-11-13 21:09:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:09:06,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:09:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 141 states and 231 transitions. [2024-11-13 21:09:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 231 transitions. [2024-11-13 21:09:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:09:06,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:06,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:09:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 143 states and 232 transitions. [2024-11-13 21:09:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 232 transitions. [2024-11-13 21:09:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 21:09:06,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:06,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:06,540 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 21:09:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 145 states and 233 transitions. [2024-11-13 21:09:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 233 transitions. [2024-11-13 21:09:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 21:09:06,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:06,610 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 21:09:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 47 states and 64 transitions. [2024-11-13 21:09:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2024-11-13 21:09:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:09:06,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:06,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 55 states and 76 transitions. [2024-11-13 21:09:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2024-11-13 21:09:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:09:07,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:07,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 57 states and 80 transitions. [2024-11-13 21:09:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2024-11-13 21:09:07,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:09:07,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:07,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 62 states and 89 transitions. [2024-11-13 21:09:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-13 21:09:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:09:10,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:10,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 64 states and 93 transitions. [2024-11-13 21:09:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-13 21:09:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:09:10,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:10,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 65 states and 93 transitions. [2024-11-13 21:09:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-13 21:09:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:09:10,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:14,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 69 states and 99 transitions. [2024-11-13 21:09:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-13 21:09:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:09:14,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:14,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:09:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 79 states and 116 transitions. [2024-11-13 21:09:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2024-11-13 21:09:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:09:18,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:09:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 79 states and 114 transitions. [2024-11-13 21:09:19,501 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2024-11-13 21:09:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:09:19,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:09:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 78 states and 110 transitions. [2024-11-13 21:09:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2024-11-13 21:09:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:09:20,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:20,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:09:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 89 states and 131 transitions. [2024-11-13 21:09:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2024-11-13 21:09:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 21:09:28,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:28,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:28,531 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 21:09:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 99 states and 144 transitions. [2024-11-13 21:09:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-13 21:09:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:09:32,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:32,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:09:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 107 states and 154 transitions. [2024-11-13 21:09:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-11-13 21:09:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:09:38,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:09:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 107 states and 153 transitions. [2024-11-13 21:09:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-11-13 21:09:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 21:09:40,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:09:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 98 states and 135 transitions. [2024-11-13 21:09:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-13 21:09:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 21:09:41,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:41,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:09:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 108 states and 149 transitions. [2024-11-13 21:09:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2024-11-13 21:09:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 21:09:47,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:09:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 110 states and 150 transitions. [2024-11-13 21:09:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2024-11-13 21:09:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:09:49,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:49,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 21:09:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 110 states and 148 transitions. [2024-11-13 21:09:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2024-11-13 21:09:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 21:09:51,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:09:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:09:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:09:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 21:09:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:09:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 41 states and 51 transitions. [2024-11-13 21:09:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-11-13 21:09:53,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:09:53,213 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 71 iterations. [2024-11-13 21:09:53,229 INFO L729 CodeCheckObserver]: All specifications hold 33 specifications checked. All of them hold [2024-11-13 21:09:57,112 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,112 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,112 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,113 INFO L77 FloydHoareUtils]: At program point L564-1(line 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,113 INFO L77 FloydHoareUtils]: At program point L564-2(line 564) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,114 INFO L77 FloydHoareUtils]: At program point L564-5(lines 564 565) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) (or (and .cse0 .cse1 |ULTIMATE.start_test_fun_#t~short15#1| .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) [2024-11-13 21:09:57,114 INFO L77 FloydHoareUtils]: At program point L556(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,115 INFO L77 FloydHoareUtils]: At program point L556-1(line 556) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= 1 |ULTIMATE.start_test_fun_#t~mem10#1|) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,115 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 568 570) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 21:09:57,115 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,115 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,115 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,115 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,116 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,116 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,116 INFO L77 FloydHoareUtils]: At program point test_fun_returnLabel#1(lines 547 567) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 21:09:57,116 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,116 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,117 INFO L77 FloydHoareUtils]: At program point L566(line 566) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,117 INFO L77 FloydHoareUtils]: At program point L566-1(line 566) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,118 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,118 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:09:57,118 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,118 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,119 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,120 INFO L77 FloydHoareUtils]: At program point L559-1(lines 559 561) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse5 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse7 (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (.cse8 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse9 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 |ULTIMATE.start_test_fun_#t~mem11#1|) .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse4 0)) (and .cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse2 .cse3 (< 0 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9))) [2024-11-13 21:09:57,120 INFO L77 FloydHoareUtils]: At program point L559-3(lines 559 561) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,121 INFO L77 FloydHoareUtils]: At program point L559-4(lines 553 563) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1) .cse6) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not .cse6) .cse0 .cse1 .cse2 .cse3 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse4 .cse5))) [2024-11-13 21:09:57,121 INFO L77 FloydHoareUtils]: At program point L551(line 551) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (= |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)) [2024-11-13 21:09:57,121 INFO L77 FloydHoareUtils]: At program point L551-1(line 551) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 4) (= |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)) [2024-11-13 21:09:57,121 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,122 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,122 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,122 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK(lines 568 570) no Hoare annotation was computed. [2024-11-13 21:09:57,122 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,122 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,122 INFO L77 FloydHoareUtils]: At program point L560(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,123 INFO L77 FloydHoareUtils]: At program point L560-1(line 560) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem12#1|) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,124 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,124 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,124 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,124 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,125 INFO L77 FloydHoareUtils]: At program point L553-1(line 553) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse4 (not |ULTIMATE.start_test_fun_#t~short6#1|)) (.cse0 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse1 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse5 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse6 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not .cse7) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse4) .cse0 .cse1 .cse2 .cse3 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse5 .cse6))) [2024-11-13 21:09:57,125 INFO L77 FloydHoareUtils]: At program point L553-2(line 553) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,125 INFO L77 FloydHoareUtils]: At program point L553-5(lines 553 563) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse7 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) .cse1 .cse2 .cse3 (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse4 .cse5 (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not |ULTIMATE.start_test_fun_#t~short6#1|) .cse6 .cse7))) [2024-11-13 21:09:57,125 INFO L77 FloydHoareUtils]: At program point L553-7(lines 553 563) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,125 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:09:57,126 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,126 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,126 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,126 INFO L77 FloydHoareUtils]: At program point L554(line 554) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) [2024-11-13 21:09:57,126 INFO L77 FloydHoareUtils]: At program point L554-1(line 554) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_#t~mem7#1| .cse0) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ |ULTIMATE.start_test_fun_#t~mem7#1| 1) (* .cse0 2)))) [2024-11-13 21:09:57,127 INFO L77 FloydHoareUtils]: At program point L554-2(lines 554 562) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_#t~mem7#1| .cse0) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= |ULTIMATE.start_test_fun_~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) (<= 1 |ULTIMATE.start_test_fun_#t~mem8#1|) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= (+ |ULTIMATE.start_test_fun_#t~mem7#1| 1) (* .cse0 2)))) [2024-11-13 21:09:57,127 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,127 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,127 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,127 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,127 INFO L77 FloydHoareUtils]: At program point L555-1(lines 555 557) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1)) (.cse1 (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) (.cse2 (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|))) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse4 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse5 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1)) (.cse8 (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_test_fun_#t~mem9#1| .cse7) .cse8 (<= 0 |ULTIMATE.start_test_fun_#t~mem9#1|)) (and .cse0 .cse1 .cse2 .cse3 (< 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (<= 1 |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 2 .cse7) .cse4 .cse5 .cse6 .cse8))) [2024-11-13 21:09:57,129 INFO L77 FloydHoareUtils]: At program point L555-3(lines 555 557) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start_test_fun_#t~malloc3#1.base| 0) |ULTIMATE.start_test_fun_#t~malloc2#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select |#valid| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) [2024-11-13 21:09:57,129 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 21:09:57,140 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:09:57,145 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:09:57,152 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:09:57,152 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:09:57,154 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:09:57,154 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:09:57,154 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 21:09:57,154 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 21:09:57,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-13 21:09:57,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-13 21:09:57,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:09:57,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:09:57,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:09:57,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:09:57,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:09:57,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:09:57,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 21:09:57,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 21:09:57,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-13 21:09:57,157 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:09:57,157 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:09:57,157 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-13 21:09:57,157 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-13 21:09:57,157 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:09:57,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:09:57,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 21:09:57,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 21:09:57,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-13 21:09:57,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-13 21:09:57,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:09:57,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:09:57,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 21:09:57,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 21:09:57,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-13 21:09:57,159 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:09:57,159 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:09:57,159 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:09:57,159 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:09:57,159 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:09:57,159 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:09:57,163 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:09:57,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:09:57,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 21:09:57,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 21:09:57,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-13 21:09:57,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-13 21:09:57,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:09:57,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:09:57,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:09:57,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:09:57,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-13 21:09:57,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-13 21:09:57,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-13 21:09:57,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-13 21:09:57,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-13 21:09:57,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:09:57,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:09:57,167 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!base [2024-11-13 21:09:57,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!base [2024-11-13 21:09:57,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 21:09:57,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 21:09:57,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc3!base [2024-11-13 21:09:57,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~malloc2!base [2024-11-13 21:09:57,168 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset [2024-11-13 21:09:57,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset [2024-11-13 21:09:57,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:09:57,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:09:57,169 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 21:09:57,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-13 21:09:57,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 21:09:57,171 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 21:09:57,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:09:57 ImpRootNode [2024-11-13 21:09:57,173 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:09:57,175 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:09:57,175 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:09:57,176 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:09:57,177 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:08:52" (3/4) ... [2024-11-13 21:09:57,179 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:09:57,190 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-13 21:09:57,191 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 21:09:57,191 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-13 21:09:57,192 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:09:57,308 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:09:57,309 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:09:57,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:09:57,310 INFO L158 Benchmark]: Toolchain (without parser) took 65954.93ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 100.9MB in the beginning and 497.8MB in the end (delta: -396.9MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. [2024-11-13 21:09:57,310 INFO L158 Benchmark]: CDTParser took 1.87ms. Allocated memory is still 167.8MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:09:57,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.39ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 84.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:09:57,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.52ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 82.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:09:57,311 INFO L158 Benchmark]: Boogie Preprocessor took 52.19ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 990.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:09:57,312 INFO L158 Benchmark]: RCFGBuilder took 823.58ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 62.3MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:09:57,312 INFO L158 Benchmark]: CodeCheck took 64348.57ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 62.3MB in the beginning and 501.9MB in the end (delta: -439.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2024-11-13 21:09:57,313 INFO L158 Benchmark]: Witness Printer took 133.67ms. Allocated memory is still 629.1MB. Free memory was 501.9MB in the beginning and 497.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:09:57,315 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 60 locations, 33 error locations. Started 1 CEGAR loops. OverallTime: 60.4s, OverallIterations: 71, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15385 SdHoareTripleChecker+Valid, 57.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13969 mSDsluCounter, 13650 SdHoareTripleChecker+Invalid, 50.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11168 mSDsCounter, 4256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27759 IncrementalHoareTripleChecker+Invalid, 32015 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4256 mSolverCounterUnsat, 2482 mSDtfsCounter, 27759 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9128 GetRequests, 8404 SyntacticMatches, 298 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88147 ImplicationChecksByTransitivity, 52.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 972 ConstructedInterpolants, 0 QuantifiedInterpolants, 5755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 60 PerfectInterpolantSequences, 159/174 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 33 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.87ms. Allocated memory is still 167.8MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.39ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 84.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.52ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 82.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.19ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 990.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 823.58ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 62.3MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 64348.57ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 62.3MB in the beginning and 501.9MB in the end (delta: -439.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * Witness Printer took 133.67ms. Allocated memory is still 629.1MB. Free memory was 501.9MB in the beginning and 497.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~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: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~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: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - 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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!offset - 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: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~y_ref~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!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: #t~malloc3!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~malloc2!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x_ref~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~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] RESULT: Ultimate proved your program to be correct! [2024-11-13 21:09:57,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d29fc99-3cb1-4927-8ea1-3b717bcd25a1/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