./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label03.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b --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 1418b02b8b2f5990b796a4d39288b2acbdc5bc3cef26e1456ee8caff9c24da11 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 00:27:21,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 00:27:21,532 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 00:27:21,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 00:27:21,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 00:27:21,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 00:27:21,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 00:27:21,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 00:27:21,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 00:27:21,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 00:27:21,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 00:27:21,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 00:27:21,561 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 00:27:21,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 00:27:21,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 00:27:21,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 00:27:21,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 00:27:21,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 00:27:21,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 00:27:21,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 00:27:21,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 00:27:21,562 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 00:27:21,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 00:27:21,562 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 00:27:21,562 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 00:27:21,562 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 00:27:21,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 00:27:21,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:27:21,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 00:27:21,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 00:27:21,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 00:27:21,563 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 00:27:21,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 00:27:21,563 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_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 1418b02b8b2f5990b796a4d39288b2acbdc5bc3cef26e1456ee8caff9c24da11 [2024-12-06 00:27:21,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 00:27:21,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 00:27:21,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 00:27:21,791 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 00:27:21,792 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 00:27:21,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label03.c [2024-12-06 00:27:24,428 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/data/a38a82b25/218656ab6e2545b7ac852bf0c09c183b/FLAG4fff67862 [2024-12-06 00:27:24,643 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 00:27:24,643 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/sv-benchmarks/c/eca-rers2012/Problem02_label03.c [2024-12-06 00:27:24,655 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/data/a38a82b25/218656ab6e2545b7ac852bf0c09c183b/FLAG4fff67862 [2024-12-06 00:27:24,670 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/data/a38a82b25/218656ab6e2545b7ac852bf0c09c183b [2024-12-06 00:27:24,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 00:27:24,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 00:27:24,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 00:27:24,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 00:27:24,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 00:27:24,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:27:24" (1/1) ... [2024-12-06 00:27:24,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ee7ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:24, skipping insertion in model container [2024-12-06 00:27:24,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:27:24" (1/1) ... [2024-12-06 00:27:24,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 00:27:24,944 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_f10cbcad-315b-4298-b10d-77e6ca6f6ada/sv-benchmarks/c/eca-rers2012/Problem02_label03.c[20079,20092] [2024-12-06 00:27:24,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:27:24,973 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 00:27:25,054 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_f10cbcad-315b-4298-b10d-77e6ca6f6ada/sv-benchmarks/c/eca-rers2012/Problem02_label03.c[20079,20092] [2024-12-06 00:27:25,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:27:25,077 INFO L204 MainTranslator]: Completed translation [2024-12-06 00:27:25,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25 WrapperNode [2024-12-06 00:27:25,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 00:27:25,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 00:27:25,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 00:27:25,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 00:27:25,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,140 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-06 00:27:25,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 00:27:25,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 00:27:25,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 00:27:25,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 00:27:25,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 00:27:25,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 00:27:25,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 00:27:25,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 00:27:25,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:27:25" (1/1) ... [2024-12-06 00:27:25,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:27:25,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 00:27:25,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 00:27:25,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 00:27:25,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 00:27:25,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 00:27:25,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 00:27:25,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 00:27:25,323 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 00:27:25,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 00:27:26,179 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-06 00:27:26,179 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 00:27:26,444 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 00:27:26,444 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 00:27:26,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:27:26 BoogieIcfgContainer [2024-12-06 00:27:26,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 00:27:26,446 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 00:27:26,446 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 00:27:26,456 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 00:27:26,457 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:27:26" (1/1) ... [2024-12-06 00:27:26,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 00:27:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-06 00:27:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-06 00:27:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 00:27:26,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:26,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 163 states and 250 transitions. [2024-12-06 00:27:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 250 transitions. [2024-12-06 00:27:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 00:27:27,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:27,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 242 states and 332 transitions. [2024-12-06 00:27:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2024-12-06 00:27:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 00:27:28,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:28,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 251 states and 343 transitions. [2024-12-06 00:27:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2024-12-06 00:27:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 00:27:28,987 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:28,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 256 states and 348 transitions. [2024-12-06 00:27:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 348 transitions. [2024-12-06 00:27:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 00:27:29,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 00:27:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-12-06 00:27:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-12-06 00:27:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 00:27:29,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:29,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2024-12-06 00:27:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2024-12-06 00:27:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 00:27:29,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:29,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 283 states and 377 transitions. [2024-12-06 00:27:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 377 transitions. [2024-12-06 00:27:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 00:27:29,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:29,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 307 states and 404 transitions. [2024-12-06 00:27:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 404 transitions. [2024-12-06 00:27:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 00:27:30,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 386 states and 488 transitions. [2024-12-06 00:27:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 488 transitions. [2024-12-06 00:27:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 00:27:30,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 410 states and 515 transitions. [2024-12-06 00:27:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 515 transitions. [2024-12-06 00:27:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 00:27:31,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 00:27:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 521 states and 632 transitions. [2024-12-06 00:27:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 632 transitions. [2024-12-06 00:27:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 00:27:32,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:32,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 528 states and 639 transitions. [2024-12-06 00:27:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 639 transitions. [2024-12-06 00:27:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 00:27:32,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:32,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 535 states and 646 transitions. [2024-12-06 00:27:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 646 transitions. [2024-12-06 00:27:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 00:27:32,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:32,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 00:27:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 541 states and 653 transitions. [2024-12-06 00:27:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 653 transitions. [2024-12-06 00:27:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 00:27:33,020 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:33,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 00:27:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 544 states and 656 transitions. [2024-12-06 00:27:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 656 transitions. [2024-12-06 00:27:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 00:27:33,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:33,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 593 states and 715 transitions. [2024-12-06 00:27:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 715 transitions. [2024-12-06 00:27:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 00:27:34,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:34,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:27:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 617 states and 745 transitions. [2024-12-06 00:27:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 745 transitions. [2024-12-06 00:27:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 00:27:34,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 00:27:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 626 states and 754 transitions. [2024-12-06 00:27:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 754 transitions. [2024-12-06 00:27:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 00:27:34,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:34,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 00:27:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 660 states and 791 transitions. [2024-12-06 00:27:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 791 transitions. [2024-12-06 00:27:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 00:27:35,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 695 states and 829 transitions. [2024-12-06 00:27:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 829 transitions. [2024-12-06 00:27:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 00:27:36,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:36,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 721 states and 862 transitions. [2024-12-06 00:27:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 862 transitions. [2024-12-06 00:27:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 00:27:36,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:36,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 751 states and 896 transitions. [2024-12-06 00:27:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 896 transitions. [2024-12-06 00:27:37,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 00:27:37,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:27:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 782 states and 937 transitions. [2024-12-06 00:27:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 937 transitions. [2024-12-06 00:27:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 00:27:38,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:38,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 00:27:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 804 states and 960 transitions. [2024-12-06 00:27:38,571 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 960 transitions. [2024-12-06 00:27:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-06 00:27:38,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 861 states and 1019 transitions. [2024-12-06 00:27:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1019 transitions. [2024-12-06 00:27:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 00:27:39,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:27:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 892 states and 1056 transitions. [2024-12-06 00:27:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1056 transitions. [2024-12-06 00:27:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 00:27:40,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:40,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:27:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 909 states and 1074 transitions. [2024-12-06 00:27:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1074 transitions. [2024-12-06 00:27:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:27:40,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:40,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 00:27:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 930 states and 1096 transitions. [2024-12-06 00:27:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1096 transitions. [2024-12-06 00:27:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-06 00:27:41,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:41,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1046 states and 1220 transitions. [2024-12-06 00:27:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1220 transitions. [2024-12-06 00:27:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 00:27:42,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:27:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1080 states and 1258 transitions. [2024-12-06 00:27:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1258 transitions. [2024-12-06 00:27:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 00:27:43,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:27:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1097 states and 1279 transitions. [2024-12-06 00:27:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1279 transitions. [2024-12-06 00:27:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 00:27:43,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 00:27:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1104 states and 1288 transitions. [2024-12-06 00:27:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1288 transitions. [2024-12-06 00:27:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 00:27:44,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-06 00:27:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1106 states and 1292 transitions. [2024-12-06 00:27:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1292 transitions. [2024-12-06 00:27:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 00:27:44,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:44,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 00:27:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1107 states and 1292 transitions. [2024-12-06 00:27:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1292 transitions. [2024-12-06 00:27:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-06 00:27:44,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1270 states and 1462 transitions. [2024-12-06 00:27:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1462 transitions. [2024-12-06 00:27:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:27:46,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-12-06 00:27:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1189 states and 1361 transitions. [2024-12-06 00:27:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1361 transitions. [2024-12-06 00:27:46,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 00:27:46,931 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 37 iterations. [2024-12-06 00:27:46,937 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 00:27:57,816 INFO L77 FloydHoareUtils]: At program point L565-1(lines 39 608) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0))) [2024-12-06 00:27:57,816 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,816 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,817 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,817 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,817 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse0 (= ~a11~0 1))) (let ((.cse1 (= ~a21~0 1)) (.cse5 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse6 (= ~a17~0 8)) (.cse4 (= ~a19~0 1)) (.cse2 (not .cse0))) (or (and .cse0 (< 10 ~a28~0)) (and (not .cse1) .cse2) (and .cse3 (not .cse4) .cse1 (= 7 ~a17~0) .cse5) (and .cse6 .cse1 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 3)) .cse2) (and (not .cse3) .cse2) (and (<= 10 ~a28~0) (<= ~a28~0 10)) (and (not (and .cse6 (= ~a28~0 11) .cse4)) .cse2) (<= ~a28~0 7)))) [2024-12-06 00:27:57,817 INFO L77 FloydHoareUtils]: At program point L568-1(lines 39 608) the Hoare annotation is: (not (and (< ~a28~0 10) (= ~a11~0 1) (< 7 ~a28~0))) [2024-12-06 00:27:57,817 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,817 INFO L75 FloydHoareUtils]: For program point L569(line 569) no Hoare annotation was computed. [2024-12-06 00:27:57,818 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,818 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,818 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,818 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse0 (= ~a11~0 1))) (let ((.cse1 (= ~a21~0 1)) (.cse5 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse6 (= ~a17~0 8)) (.cse4 (= ~a19~0 1)) (.cse2 (not .cse0))) (or (and .cse0 (< 10 ~a28~0)) (and (not .cse1) .cse2) (and .cse3 (not .cse4) .cse1 (= 7 ~a17~0) .cse5) (and .cse6 .cse1 .cse4 .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 3)) .cse2) (and (not .cse3) .cse2) (and (<= 10 ~a28~0) (<= ~a28~0 10)) (and (not (and .cse6 (= ~a28~0 11) .cse4)) .cse2) (<= ~a28~0 7)))) [2024-12-06 00:27:57,818 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,818 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,819 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,819 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,819 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,819 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,819 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,819 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,820 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,820 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,820 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,820 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,820 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,820 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,820 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,820 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,821 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 00:27:57,821 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,821 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,821 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,821 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,822 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,822 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,822 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,822 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,822 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,822 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2024-12-06 00:27:57,822 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,823 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,823 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,823 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,823 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,823 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,823 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,823 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,823 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,823 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,824 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,824 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,824 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,824 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,824 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,824 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,824 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,824 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,824 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-06 00:27:57,825 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,825 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,825 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,825 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,825 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,825 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,825 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,825 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,826 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,827 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (not (let ((.cse1 (= ~a21~0 1)) (.cse0 (= ~a19~0 1)) (.cse2 (= ~a28~0 9))) (and (< ~a28~0 10) (not (and (= ~a25~0 1) (not .cse0) .cse1 (= 7 ~a17~0) .cse2)) (= ~a11~0 1) (< 7 ~a28~0) (not (and (= ~a17~0 8) .cse1 .cse0 .cse2))))) [2024-12-06 00:27:57,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 12:27:57 ImpRootNode [2024-12-06 00:27:57,837 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 00:27:57,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 00:27:57,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 00:27:57,838 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 00:27:57,838 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:27:26" (3/4) ... [2024-12-06 00:27:57,841 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 00:27:57,854 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2024-12-06 00:27:57,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 00:27:57,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 00:27:57,856 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 00:27:57,971 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 00:27:57,971 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 00:27:57,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 00:27:57,972 INFO L158 Benchmark]: Toolchain (without parser) took 33298.84ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 114.8MB in the beginning and 351.6MB in the end (delta: -236.7MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2024-12-06 00:27:57,972 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:27:57,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.88ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 88.6MB in the end (delta: 26.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 00:27:57,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.13ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 83.5MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:27:57,973 INFO L158 Benchmark]: Boogie Preprocessor took 57.13ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 79.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:27:57,973 INFO L158 Benchmark]: RCFGBuilder took 1246.67ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 68.5MB in the end (delta: 10.8MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2024-12-06 00:27:57,974 INFO L158 Benchmark]: CodeCheck took 31391.56ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 68.5MB in the beginning and 364.2MB in the end (delta: -295.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-12-06 00:27:57,974 INFO L158 Benchmark]: Witness Printer took 133.48ms. Allocated memory is still 453.0MB. Free memory was 364.2MB in the beginning and 351.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 00:27:57,976 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: 20.5s, OverallIterations: 37, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43960 SdHoareTripleChecker+Valid, 117.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43644 mSDsluCounter, 6255 SdHoareTripleChecker+Invalid, 97.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5223 mSDsCounter, 16657 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101160 IncrementalHoareTripleChecker+Invalid, 117817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16657 mSolverCounterUnsat, 1032 mSDtfsCounter, 101160 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34534 GetRequests, 33735 SyntacticMatches, 525 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36718 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 4716 NumberOfCodeBlocks, 4716 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4680 ConstructedInterpolants, 0 QuantifiedInterpolants, 15666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 30 PerfectInterpolantSequences, 2168/2266 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 569]: 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: !(((((a28 < 10) && !(((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) && (a11 == 1)) && (7 < a28)) && !((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: !(((((a28 < 10) && !(((((a25 == 1) && (a19 != 1)) && (a21 == 1)) && (7 == a17)) && (a28 == 9))) && (a11 == 1)) && (7 < a28)) && !((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.88ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 88.6MB in the end (delta: 26.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.13ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 83.5MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.13ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 79.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1246.67ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 68.5MB in the end (delta: 10.8MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * CodeCheck took 31391.56ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 68.5MB in the beginning and 364.2MB in the end (delta: -295.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 133.48ms. Allocated memory is still 453.0MB. Free memory was 364.2MB in the beginning and 351.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 00:27:57,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10cbcad-315b-4298-b10d-77e6ca6f6ada/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE