./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/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_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label38.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a670cdf39cff768f377fda4aa36462d7d9bf374db1f5d06db7ce4e528593b74a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 22:56:36,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 22:56:37,028 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 22:56:37,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 22:56:37,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 22:56:37,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 22:56:37,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 22:56:37,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 22:56:37,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 22:56:37,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 22:56:37,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 22:56:37,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 22:56:37,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 22:56:37,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 22:56:37,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 22:56:37,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 22:56:37,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 22:56:37,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 22:56:37,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 22:56:37,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 22:56:37,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 22:56:37,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 22:56:37,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 22:56:37,063 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 22:56:37,063 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 22:56:37,063 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 22:56:37,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 22:56:37,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:56:37,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 22:56:37,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 22:56:37,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 22:56:37,064 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 22:56:37,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 22:56:37,065 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_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a670cdf39cff768f377fda4aa36462d7d9bf374db1f5d06db7ce4e528593b74a [2024-11-13 22:56:37,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 22:56:37,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 22:56:37,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 22:56:37,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 22:56:37,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 22:56:37,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem02_label38.c Unable to find full path for "g++" [2024-11-13 22:56:39,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 22:56:39,870 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 22:56:39,875 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/sv-benchmarks/c/eca-rers2012/Problem02_label38.c [2024-11-13 22:56:39,899 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/data/3f2a96c8c/7a22174086b044b5b2a86f891ea8ce38/FLAG307af3dd0 [2024-11-13 22:56:39,921 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/data/3f2a96c8c/7a22174086b044b5b2a86f891ea8ce38 [2024-11-13 22:56:39,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 22:56:39,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 22:56:39,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 22:56:39,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 22:56:39,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 22:56:39,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:56:39" (1/1) ... [2024-11-13 22:56:39,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29df1b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:39, skipping insertion in model container [2024-11-13 22:56:39,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 10:56:39" (1/1) ... [2024-11-13 22:56:39,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 22:56:40,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/sv-benchmarks/c/eca-rers2012/Problem02_label38.c[20309,20322] [2024-11-13 22:56:40,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:56:40,401 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 22:56:40,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/sv-benchmarks/c/eca-rers2012/Problem02_label38.c[20309,20322] [2024-11-13 22:56:40,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 22:56:40,599 INFO L204 MainTranslator]: Completed translation [2024-11-13 22:56:40,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40 WrapperNode [2024-11-13 22:56:40,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 22:56:40,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 22:56:40,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 22:56:40,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 22:56:40,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,675 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-13 22:56:40,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 22:56:40,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 22:56:40,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 22:56:40,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 22:56:40,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 22:56:40,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 22:56:40,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 22:56:40,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 22:56:40,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 10:56:40" (1/1) ... [2024-11-13 22:56:40,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 22:56:40,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 22:56:40,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 22:56:40,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 22:56:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 22:56:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 22:56:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 22:56:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 22:56:40,964 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 22:56:40,966 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 22:56:42,302 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-13 22:56:42,302 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 22:56:42,658 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 22:56:42,660 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 22:56:42,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:56:42 BoogieIcfgContainer [2024-11-13 22:56:42,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 22:56:42,661 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 22:56:42,661 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 22:56:42,672 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 22:56:42,672 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:56:42" (1/1) ... [2024-11-13 22:56:42,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 22:56:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-13 22:56:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-13 22:56:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 22:56:42,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:43,416 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 22:56:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-11-13 22:56:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-11-13 22:56:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-13 22:56:44,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:44,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:56:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 242 states and 336 transitions. [2024-11-13 22:56:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 336 transitions. [2024-11-13 22:56:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 22:56:45,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 22:56:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 329 states and 427 transitions. [2024-11-13 22:56:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 427 transitions. [2024-11-13 22:56:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 22:56:46,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 22:56:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 347 states and 448 transitions. [2024-11-13 22:56:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 448 transitions. [2024-11-13 22:56:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 22:56:46,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:46,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 22:56:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:47,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 366 states and 470 transitions. [2024-11-13 22:56:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 470 transitions. [2024-11-13 22:56:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 22:56:47,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:47,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 22:56:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 374 states and 478 transitions. [2024-11-13 22:56:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 478 transitions. [2024-11-13 22:56:47,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-13 22:56:47,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 22:56:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 375 states and 480 transitions. [2024-11-13 22:56:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 480 transitions. [2024-11-13 22:56:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 22:56:48,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:48,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 22:56:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 376 states and 480 transitions. [2024-11-13 22:56:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 480 transitions. [2024-11-13 22:56:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-13 22:56:48,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:48,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-13 22:56:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 377 states and 480 transitions. [2024-11-13 22:56:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 480 transitions. [2024-11-13 22:56:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 22:56:48,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 22:56:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 438 states and 540 transitions. [2024-11-13 22:56:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 540 transitions. [2024-11-13 22:56:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 22:56:49,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 22:56:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 22:56:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 22:56:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 22:56:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 22:56:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 250 states and 320 transitions. [2024-11-13 22:56:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 320 transitions. [2024-11-13 22:56:50,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 22:56:50,425 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 12 iterations. [2024-11-13 22:56:50,440 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-13 22:56:53,011 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,011 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,012 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,012 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,012 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,012 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,013 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,013 INFO L77 FloydHoareUtils]: At program point L571-1(lines 39 608) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,013 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,013 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,013 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,013 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,014 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,014 INFO L77 FloydHoareUtils]: At program point L574-1(lines 39 608) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,014 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,014 INFO L75 FloydHoareUtils]: For program point L575(line 575) no Hoare annotation was computed. [2024-11-13 22:56:53,014 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,014 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,015 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,015 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,015 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,015 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,015 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,015 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,016 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,016 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,016 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,016 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,016 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,016 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 22:56:53,017 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,017 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,017 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,017 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,017 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,017 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,018 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,018 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,018 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,018 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 575) no Hoare annotation was computed. [2024-11-13 22:56:53,018 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,018 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,019 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,019 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,019 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,019 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,020 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,020 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,020 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,020 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,020 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,020 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,020 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,021 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,021 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,021 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,021 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,021 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,021 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-13 22:56:53,022 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,022 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,022 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,022 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,022 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,022 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,022 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,023 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,023 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,023 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,023 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,023 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,023 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,024 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,024 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,024 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,024 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,024 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,024 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 22:56:53,025 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,025 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,025 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,025 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,025 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,025 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,026 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (or (and (< 10 ~a28~0) (= ~a19~0 1)) (and (<= ~a17~0 8) (<= ~a28~0 10))) [2024-11-13 22:56:53,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 10:56:53 ImpRootNode [2024-11-13 22:56:53,040 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 22:56:53,040 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 22:56:53,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 22:56:53,041 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 22:56:53,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 10:56:42" (3/4) ... [2024-11-13 22:56:53,044 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 22:56:53,074 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-11-13 22:56:53,075 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-13 22:56:53,076 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 22:56:53,077 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 22:56:53,264 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 22:56:53,264 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 22:56:53,265 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 22:56:53,268 INFO L158 Benchmark]: Toolchain (without parser) took 13339.76ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 91.1MB in the beginning and 142.6MB in the end (delta: -51.5MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2024-11-13 22:56:53,268 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:56:53,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 672.07ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 65.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 22:56:53,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.05ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 60.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:56:53,269 INFO L158 Benchmark]: Boogie Preprocessor took 97.26ms. Allocated memory is still 117.4MB. Free memory was 60.1MB in the beginning and 56.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 22:56:53,270 INFO L158 Benchmark]: RCFGBuilder took 1886.50ms. Allocated memory is still 117.4MB. Free memory was 56.2MB in the beginning and 84.2MB in the end (delta: -28.0MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2024-11-13 22:56:53,271 INFO L158 Benchmark]: CodeCheck took 10378.48ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 84.2MB in the beginning and 153.3MB in the end (delta: -69.1MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2024-11-13 22:56:53,272 INFO L158 Benchmark]: Witness Printer took 224.43ms. Allocated memory is still 234.9MB. Free memory was 153.3MB in the beginning and 142.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 22:56:53,274 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6209 SdHoareTripleChecker+Valid, 23.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6129 mSDsluCounter, 821 SdHoareTripleChecker+Invalid, 19.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 646 mSDsCounter, 3053 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14808 IncrementalHoareTripleChecker+Invalid, 17861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3053 mSolverCounterUnsat, 175 mSDtfsCounter, 14808 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10859 GetRequests, 10408 SyntacticMatches, 413 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1418 NumberOfCodeBlocks, 1418 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1407 ConstructedInterpolants, 0 QuantifiedInterpolants, 3393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 588/588 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: 575]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((10 < a28) && (a19 == 1)) || ((a17 <= 8) && (a28 <= 10))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((10 < a28) && (a19 == 1)) || ((a17 <= 8) && (a28 <= 10))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 672.07ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 65.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.05ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 60.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.26ms. Allocated memory is still 117.4MB. Free memory was 60.1MB in the beginning and 56.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1886.50ms. Allocated memory is still 117.4MB. Free memory was 56.2MB in the beginning and 84.2MB in the end (delta: -28.0MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * CodeCheck took 10378.48ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 84.2MB in the beginning and 153.3MB in the end (delta: -69.1MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * Witness Printer took 224.43ms. Allocated memory is still 234.9MB. Free memory was 153.3MB in the beginning and 142.6MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 22:56:53,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfc7ee17-47e2-4e1f-8f6a-754c4c2e52b0/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