./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label10.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_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3 --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 b406ff3fd0da0465581d2165eb1f16564f4bf2c96c00f3bdd76ed4230f7217fd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 02:15:33,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 02:15:33,808 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 02:15:33,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 02:15:33,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 02:15:33,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 02:15:33,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 02:15:33,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 02:15:33,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 02:15:33,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 02:15:33,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 02:15:33,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 02:15:33,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 02:15:33,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 02:15:33,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 02:15:33,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 02:15:33,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 02:15:33,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 02:15:33,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 02:15:33,846 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 02:15:33,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 02:15:33,846 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 02:15:33,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 02:15:33,847 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 02:15:33,847 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 02:15:33,847 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 02:15:33,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 02:15:33,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:15:33,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 02:15:33,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 02:15:33,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 02:15:33,848 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 02:15:33,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 02:15:33,849 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_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3 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 -> b406ff3fd0da0465581d2165eb1f16564f4bf2c96c00f3bdd76ed4230f7217fd [2024-11-25 02:15:34,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 02:15:34,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 02:15:34,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 02:15:34,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 02:15:34,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 02:15:34,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem02_label10.c [2024-11-25 02:15:37,956 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/data/40f4fed11/f03933a6640b4742b28f539c6768809f/FLAG1291a7bcb [2024-11-25 02:15:38,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 02:15:38,302 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/sv-benchmarks/c/eca-rers2012/Problem02_label10.c [2024-11-25 02:15:38,324 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/data/40f4fed11/f03933a6640b4742b28f539c6768809f/FLAG1291a7bcb [2024-11-25 02:15:38,355 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/data/40f4fed11/f03933a6640b4742b28f539c6768809f [2024-11-25 02:15:38,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 02:15:38,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 02:15:38,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 02:15:38,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 02:15:38,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 02:15:38,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:38,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdb7a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38, skipping insertion in model container [2024-11-25 02:15:38,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:38,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 02:15:38,776 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_d349ae6f-68eb-4559-b75f-462a6152f664/sv-benchmarks/c/eca-rers2012/Problem02_label10.c[20766,20779] [2024-11-25 02:15:38,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:15:38,803 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 02:15:38,931 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_d349ae6f-68eb-4559-b75f-462a6152f664/sv-benchmarks/c/eca-rers2012/Problem02_label10.c[20766,20779] [2024-11-25 02:15:38,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:15:38,966 INFO L204 MainTranslator]: Completed translation [2024-11-25 02:15:38,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38 WrapperNode [2024-11-25 02:15:38,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 02:15:38,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 02:15:38,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 02:15:38,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 02:15:38,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:38,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,080 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-25 02:15:39,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 02:15:39,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 02:15:39,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 02:15:39,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 02:15:39,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 02:15:39,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 02:15:39,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 02:15:39,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 02:15:39,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:15:38" (1/1) ... [2024-11-25 02:15:39,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:15:39,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 02:15:39,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 02:15:39,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 02:15:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 02:15:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 02:15:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 02:15:39,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 02:15:39,311 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 02:15:39,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 02:15:40,623 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-25 02:15:40,624 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 02:15:40,962 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 02:15:40,963 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 02:15:40,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:15:40 BoogieIcfgContainer [2024-11-25 02:15:40,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 02:15:40,966 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 02:15:40,966 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 02:15:40,983 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 02:15:40,984 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:15:40" (1/1) ... [2024-11-25 02:15:40,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 02:15:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-25 02:15:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-25 02:15:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 02:15:41,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:41,668 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-25 02:15:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 163 states and 240 transitions. [2024-11-25 02:15:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2024-11-25 02:15:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 02:15:42,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 166 states and 245 transitions. [2024-11-25 02:15:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-11-25 02:15:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-25 02:15:43,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:43,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:15:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 167 states and 248 transitions. [2024-11-25 02:15:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2024-11-25 02:15:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-25 02:15:43,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:43,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 184 states and 274 transitions. [2024-11-25 02:15:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2024-11-25 02:15:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 02:15:43,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:44,133 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-25 02:15:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 202 states and 296 transitions. [2024-11-25 02:15:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 296 transitions. [2024-11-25 02:15:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 02:15:44,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:44,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 220 states and 323 transitions. [2024-11-25 02:15:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 323 transitions. [2024-11-25 02:15:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 02:15:45,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 223 states and 327 transitions. [2024-11-25 02:15:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2024-11-25 02:15:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 02:15:45,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:45,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:45,838 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-25 02:15:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 227 states and 334 transitions. [2024-11-25 02:15:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 334 transitions. [2024-11-25 02:15:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 02:15:46,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:46,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:46,459 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-25 02:15:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 244 states and 351 transitions. [2024-11-25 02:15:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 351 transitions. [2024-11-25 02:15:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 02:15:46,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 264 states and 375 transitions. [2024-11-25 02:15:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2024-11-25 02:15:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 02:15:47,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 02:15:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 268 states and 382 transitions. [2024-11-25 02:15:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 382 transitions. [2024-11-25 02:15:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 02:15:48,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:48,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 372 states and 496 transitions. [2024-11-25 02:15:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 496 transitions. [2024-11-25 02:15:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 02:15:50,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:50,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 388 states and 518 transitions. [2024-11-25 02:15:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 518 transitions. [2024-11-25 02:15:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 02:15:51,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 391 states and 521 transitions. [2024-11-25 02:15:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 521 transitions. [2024-11-25 02:15:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 02:15:51,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:51,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 415 states and 550 transitions. [2024-11-25 02:15:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 550 transitions. [2024-11-25 02:15:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 02:15:53,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:53,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 429 states and 563 transitions. [2024-11-25 02:15:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 563 transitions. [2024-11-25 02:15:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 02:15:53,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 454 states and 598 transitions. [2024-11-25 02:15:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 598 transitions. [2024-11-25 02:15:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-25 02:15:55,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:55,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 468 states and 618 transitions. [2024-11-25 02:15:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 618 transitions. [2024-11-25 02:15:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 02:15:55,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:55,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 474 states and 626 transitions. [2024-11-25 02:15:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 626 transitions. [2024-11-25 02:15:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 02:15:56,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:56,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 475 states and 626 transitions. [2024-11-25 02:15:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 626 transitions. [2024-11-25 02:15:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 02:15:56,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 504 states and 668 transitions. [2024-11-25 02:15:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 668 transitions. [2024-11-25 02:15:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 02:15:58,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 518 states and 682 transitions. [2024-11-25 02:15:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 682 transitions. [2024-11-25 02:15:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 02:15:58,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 524 states and 689 transitions. [2024-11-25 02:15:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 689 transitions. [2024-11-25 02:15:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 02:15:59,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:59,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 538 states and 706 transitions. [2024-11-25 02:16:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 706 transitions. [2024-11-25 02:16:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 02:16:00,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 544 states and 712 transitions. [2024-11-25 02:16:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 712 transitions. [2024-11-25 02:16:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 02:16:00,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:00,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 549 states and 717 transitions. [2024-11-25 02:16:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 717 transitions. [2024-11-25 02:16:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 02:16:00,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 555 states and 723 transitions. [2024-11-25 02:16:01,482 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 723 transitions. [2024-11-25 02:16:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 02:16:01,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:01,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 563 states and 732 transitions. [2024-11-25 02:16:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 732 transitions. [2024-11-25 02:16:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 02:16:01,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:01,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 568 states and 736 transitions. [2024-11-25 02:16:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 736 transitions. [2024-11-25 02:16:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 02:16:02,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 02:16:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 597 states and 774 transitions. [2024-11-25 02:16:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 774 transitions. [2024-11-25 02:16:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 02:16:03,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:03,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 02:16:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 614 states and 791 transitions. [2024-11-25 02:16:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 791 transitions. [2024-11-25 02:16:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-25 02:16:03,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:03,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 636 states and 816 transitions. [2024-11-25 02:16:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 816 transitions. [2024-11-25 02:16:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 02:16:03,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:16:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 649 states and 833 transitions. [2024-11-25 02:16:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 833 transitions. [2024-11-25 02:16:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 02:16:04,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:16:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 659 states and 843 transitions. [2024-11-25 02:16:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 843 transitions. [2024-11-25 02:16:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 02:16:04,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:16:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 664 states and 847 transitions. [2024-11-25 02:16:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 847 transitions. [2024-11-25 02:16:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-25 02:16:05,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 670 states and 853 transitions. [2024-11-25 02:16:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 853 transitions. [2024-11-25 02:16:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 02:16:06,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:06,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:16:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 701 states and 886 transitions. [2024-11-25 02:16:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 886 transitions. [2024-11-25 02:16:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 02:16:06,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:16:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 706 states and 890 transitions. [2024-11-25 02:16:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 890 transitions. [2024-11-25 02:16:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 02:16:07,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 715 states and 899 transitions. [2024-11-25 02:16:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 899 transitions. [2024-11-25 02:16:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 02:16:07,529 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:07,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 747 states and 938 transitions. [2024-11-25 02:16:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 938 transitions. [2024-11-25 02:16:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 02:16:09,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:09,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 758 states and 950 transitions. [2024-11-25 02:16:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 950 transitions. [2024-11-25 02:16:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-25 02:16:10,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 02:16:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 765 states and 959 transitions. [2024-11-25 02:16:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 959 transitions. [2024-11-25 02:16:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 02:16:10,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:10,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:16:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 769 states and 965 transitions. [2024-11-25 02:16:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 965 transitions. [2024-11-25 02:16:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-25 02:16:10,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:10,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:16:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 770 states and 966 transitions. [2024-11-25 02:16:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 966 transitions. [2024-11-25 02:16:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-25 02:16:11,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:11,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 801 states and 998 transitions. [2024-11-25 02:16:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 998 transitions. [2024-11-25 02:16:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 02:16:11,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:11,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 02:16:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 808 states and 1008 transitions. [2024-11-25 02:16:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1008 transitions. [2024-11-25 02:16:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 02:16:12,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 02:16:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 813 states and 1012 transitions. [2024-11-25 02:16:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1012 transitions. [2024-11-25 02:16:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 02:16:12,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 02:16:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 820 states and 1020 transitions. [2024-11-25 02:16:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1020 transitions. [2024-11-25 02:16:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 02:16:13,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:13,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 887 states and 1097 transitions. [2024-11-25 02:16:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1097 transitions. [2024-11-25 02:16:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 02:16:16,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:16,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:16:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 912 states and 1128 transitions. [2024-11-25 02:16:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1128 transitions. [2024-11-25 02:16:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 02:16:18,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:18,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:16:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 935 states and 1153 transitions. [2024-11-25 02:16:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1153 transitions. [2024-11-25 02:16:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 02:16:19,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:19,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:16:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 940 states and 1157 transitions. [2024-11-25 02:16:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1157 transitions. [2024-11-25 02:16:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 02:16:19,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:19,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:16:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 945 states and 1161 transitions. [2024-11-25 02:16:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1161 transitions. [2024-11-25 02:16:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-25 02:16:20,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:16:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 946 states and 1162 transitions. [2024-11-25 02:16:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1162 transitions. [2024-11-25 02:16:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 02:16:20,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:20,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1013 states and 1239 transitions. [2024-11-25 02:16:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1239 transitions. [2024-11-25 02:16:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 02:16:24,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1035 states and 1260 transitions. [2024-11-25 02:16:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1260 transitions. [2024-11-25 02:16:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 02:16:26,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:26,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1040 states and 1264 transitions. [2024-11-25 02:16:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1264 transitions. [2024-11-25 02:16:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 02:16:26,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:26,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1045 states and 1270 transitions. [2024-11-25 02:16:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1270 transitions. [2024-11-25 02:16:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 02:16:28,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1051 states and 1277 transitions. [2024-11-25 02:16:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1277 transitions. [2024-11-25 02:16:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 02:16:29,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1113 states and 1349 transitions. [2024-11-25 02:16:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1349 transitions. [2024-11-25 02:16:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 02:16:32,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1118 states and 1353 transitions. [2024-11-25 02:16:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1353 transitions. [2024-11-25 02:16:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 02:16:33,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:33,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1133 states and 1370 transitions. [2024-11-25 02:16:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1370 transitions. [2024-11-25 02:16:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 02:16:34,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1136 states and 1374 transitions. [2024-11-25 02:16:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1374 transitions. [2024-11-25 02:16:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 02:16:35,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1141 states and 1378 transitions. [2024-11-25 02:16:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1378 transitions. [2024-11-25 02:16:35,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 02:16:35,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1177 states and 1417 transitions. [2024-11-25 02:16:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1417 transitions. [2024-11-25 02:16:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-25 02:16:40,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:40,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1188 states and 1432 transitions. [2024-11-25 02:16:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1432 transitions. [2024-11-25 02:16:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-25 02:16:41,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:41,826 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-25 02:16:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1189 states and 1432 transitions. [2024-11-25 02:16:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1432 transitions. [2024-11-25 02:16:41,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 02:16:41,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:41,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:16:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1202 states and 1445 transitions. [2024-11-25 02:16:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1445 transitions. [2024-11-25 02:16:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 02:16:42,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:16:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1212 states and 1454 transitions. [2024-11-25 02:16:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1454 transitions. [2024-11-25 02:16:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-25 02:16:43,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 02:16:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1291 states and 1549 transitions. [2024-11-25 02:16:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1549 transitions. [2024-11-25 02:16:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 02:16:44,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:44,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:16:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1292 states and 1551 transitions. [2024-11-25 02:16:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1551 transitions. [2024-11-25 02:16:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 02:16:45,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:45,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1302 states and 1563 transitions. [2024-11-25 02:16:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1563 transitions. [2024-11-25 02:16:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 02:16:46,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:16:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1303 states and 1564 transitions. [2024-11-25 02:16:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1564 transitions. [2024-11-25 02:16:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-25 02:16:47,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:47,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1306 states and 1567 transitions. [2024-11-25 02:16:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1567 transitions. [2024-11-25 02:16:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 02:16:47,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:47,775 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-25 02:16:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1325 states and 1589 transitions. [2024-11-25 02:16:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1589 transitions. [2024-11-25 02:16:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 02:16:48,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:48,576 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-25 02:16:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1329 states and 1593 transitions. [2024-11-25 02:16:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1593 transitions. [2024-11-25 02:16:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-25 02:16:49,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 02:16:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1331 states and 1595 transitions. [2024-11-25 02:16:49,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1595 transitions. [2024-11-25 02:16:49,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 02:16:49,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:49,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1372 states and 1650 transitions. [2024-11-25 02:16:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1650 transitions. [2024-11-25 02:16:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 02:16:53,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:53,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1408 states and 1689 transitions. [2024-11-25 02:16:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1689 transitions. [2024-11-25 02:16:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 02:16:56,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1413 states and 1693 transitions. [2024-11-25 02:16:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1693 transitions. [2024-11-25 02:16:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 02:16:56,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:56,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1417 states and 1696 transitions. [2024-11-25 02:16:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1696 transitions. [2024-11-25 02:16:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-25 02:16:57,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:57,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:57,167 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-25 02:16:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1428 states and 1718 transitions. [2024-11-25 02:16:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1718 transitions. [2024-11-25 02:16:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-25 02:16:59,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-25 02:16:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1435 states and 1728 transitions. [2024-11-25 02:16:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1728 transitions. [2024-11-25 02:16:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 02:16:59,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-25 02:17:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1448 states and 1742 transitions. [2024-11-25 02:17:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1742 transitions. [2024-11-25 02:17:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 02:17:00,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:00,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-25 02:17:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1453 states and 1746 transitions. [2024-11-25 02:17:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1746 transitions. [2024-11-25 02:17:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 02:17:00,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:00,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-25 02:17:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1463 states and 1756 transitions. [2024-11-25 02:17:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1756 transitions. [2024-11-25 02:17:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 02:17:01,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-25 02:17:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1468 states and 1760 transitions. [2024-11-25 02:17:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1760 transitions. [2024-11-25 02:17:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 02:17:02,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 02:17:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1480 states and 1775 transitions. [2024-11-25 02:17:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1775 transitions. [2024-11-25 02:17:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 02:17:02,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:02,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 02:17:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1503 states and 1800 transitions. [2024-11-25 02:17:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1800 transitions. [2024-11-25 02:17:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 02:17:04,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 02:17:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1518 states and 1815 transitions. [2024-11-25 02:17:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1815 transitions. [2024-11-25 02:17:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 02:17:05,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 02:17:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1535 states and 1832 transitions. [2024-11-25 02:17:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1832 transitions. [2024-11-25 02:17:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 02:17:06,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:17:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1545 states and 1844 transitions. [2024-11-25 02:17:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1844 transitions. [2024-11-25 02:17:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 02:17:07,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:17:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1562 states and 1865 transitions. [2024-11-25 02:17:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1865 transitions. [2024-11-25 02:17:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-25 02:17:09,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:17:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1575 states and 1881 transitions. [2024-11-25 02:17:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1881 transitions. [2024-11-25 02:17:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 02:17:10,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:10,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:17:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1587 states and 1893 transitions. [2024-11-25 02:17:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1893 transitions. [2024-11-25 02:17:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 02:17:10,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:10,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:17:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1592 states and 1897 transitions. [2024-11-25 02:17:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1897 transitions. [2024-11-25 02:17:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 02:17:11,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:17:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1605 states and 1910 transitions. [2024-11-25 02:17:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1910 transitions. [2024-11-25 02:17:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 02:17:12,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 02:17:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1609 states and 1913 transitions. [2024-11-25 02:17:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1913 transitions. [2024-11-25 02:17:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 02:17:12,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:17:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1611 states and 1915 transitions. [2024-11-25 02:17:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1915 transitions. [2024-11-25 02:17:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-25 02:17:13,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 02:17:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1620 states and 1931 transitions. [2024-11-25 02:17:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1931 transitions. [2024-11-25 02:17:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-25 02:17:14,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:14,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 02:17:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1640 states and 1952 transitions. [2024-11-25 02:17:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1952 transitions. [2024-11-25 02:17:15,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-25 02:17:15,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:15,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 02:17:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1654 states and 1965 transitions. [2024-11-25 02:17:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1965 transitions. [2024-11-25 02:17:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 02:17:16,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:16,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:17:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 1816 states and 2162 transitions. [2024-11-25 02:17:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2162 transitions. [2024-11-25 02:17:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 02:17:25,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:25,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:17:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 1836 states and 2181 transitions. [2024-11-25 02:17:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2181 transitions. [2024-11-25 02:17:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 02:17:26,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:26,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:17:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 1880 states and 2234 transitions. [2024-11-25 02:17:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2234 transitions. [2024-11-25 02:17:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 02:17:31,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:31,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:17:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1911 states and 2271 transitions. [2024-11-25 02:17:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2271 transitions. [2024-11-25 02:17:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 02:17:34,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:17:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 1916 states and 2275 transitions. [2024-11-25 02:17:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2275 transitions. [2024-11-25 02:17:35,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-25 02:17:35,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-25 02:17:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 1943 states and 2306 transitions. [2024-11-25 02:17:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2306 transitions. [2024-11-25 02:17:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 02:17:36,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:36,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-25 02:17:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1955 states and 2318 transitions. [2024-11-25 02:17:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2318 transitions. [2024-11-25 02:17:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 02:17:37,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:37,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:17:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 1975 states and 2341 transitions. [2024-11-25 02:17:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2341 transitions. [2024-11-25 02:17:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 02:17:40,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:40,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 142 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-25 02:17:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 1993 states and 2368 transitions. [2024-11-25 02:17:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2368 transitions. [2024-11-25 02:17:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 02:17:42,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:42,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 02:17:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 1999 states and 2374 transitions. [2024-11-25 02:17:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2374 transitions. [2024-11-25 02:17:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 02:17:43,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:43,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 02:17:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2005 states and 2382 transitions. [2024-11-25 02:17:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2382 transitions. [2024-11-25 02:17:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 02:17:44,260 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 02:17:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2011 states and 2388 transitions. [2024-11-25 02:17:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2388 transitions. [2024-11-25 02:17:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 02:17:45,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:45,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 02:17:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2016 states and 2393 transitions. [2024-11-25 02:17:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2393 transitions. [2024-11-25 02:17:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 02:17:46,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:46,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 02:17:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2017 states and 2394 transitions. [2024-11-25 02:17:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2394 transitions. [2024-11-25 02:17:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-25 02:17:47,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 93 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:17:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2178 states and 2568 transitions. [2024-11-25 02:17:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2568 transitions. [2024-11-25 02:17:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 02:17:54,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:54,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-11-25 02:18:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2328 states and 2727 transitions. [2024-11-25 02:18:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2727 transitions. [2024-11-25 02:18:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 02:18:01,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:01,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-25 02:18:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2334 states and 2732 transitions. [2024-11-25 02:18:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 2732 transitions. [2024-11-25 02:18:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 02:18:03,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-25 02:18:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2344 states and 2742 transitions. [2024-11-25 02:18:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2742 transitions. [2024-11-25 02:18:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 02:18:04,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:04,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-25 02:18:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2349 states and 2746 transitions. [2024-11-25 02:18:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 2746 transitions. [2024-11-25 02:18:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 02:18:05,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:05,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-25 02:18:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2375 states and 2773 transitions. [2024-11-25 02:18:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2773 transitions. [2024-11-25 02:18:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 02:18:07,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-25 02:18:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2376 states and 2773 transitions. [2024-11-25 02:18:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2773 transitions. [2024-11-25 02:18:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-25 02:18:07,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:07,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-25 02:18:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2383 states and 2783 transitions. [2024-11-25 02:18:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2783 transitions. [2024-11-25 02:18:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-25 02:18:11,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-25 02:18:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2388 states and 2787 transitions. [2024-11-25 02:18:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 2787 transitions. [2024-11-25 02:18:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-25 02:18:11,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-25 02:18:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2400 states and 2799 transitions. [2024-11-25 02:18:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2799 transitions. [2024-11-25 02:18:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-25 02:18:14,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-25 02:18:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2406 states and 2805 transitions. [2024-11-25 02:18:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2805 transitions. [2024-11-25 02:18:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-25 02:18:15,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:15,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-25 02:18:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2412 states and 2812 transitions. [2024-11-25 02:18:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2812 transitions. [2024-11-25 02:18:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 02:18:17,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-25 02:18:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2418 states and 2818 transitions. [2024-11-25 02:18:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2818 transitions. [2024-11-25 02:18:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 02:18:18,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-25 02:18:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2419 states and 2820 transitions. [2024-11-25 02:18:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2820 transitions. [2024-11-25 02:18:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 02:18:19,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:19,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-25 02:18:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2424 states and 2826 transitions. [2024-11-25 02:18:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2826 transitions. [2024-11-25 02:18:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-25 02:18:21,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:21,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-25 02:18:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2503 states and 2906 transitions. [2024-11-25 02:18:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2906 transitions. [2024-11-25 02:18:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-25 02:18:22,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:22,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-25 02:18:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 2617 states and 3032 transitions. [2024-11-25 02:18:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 3032 transitions. [2024-11-25 02:18:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-25 02:18:34,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-25 02:18:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 2649 states and 3063 transitions. [2024-11-25 02:18:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3063 transitions. [2024-11-25 02:18:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-25 02:18:39,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:39,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-25 02:18:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 2683 states and 3095 transitions. [2024-11-25 02:18:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3095 transitions. [2024-11-25 02:18:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 02:18:43,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:43,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 214 proven. 4 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-25 02:18:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 2690 states and 3107 transitions. [2024-11-25 02:18:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3107 transitions. [2024-11-25 02:18:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 02:18:44,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:44,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 02:18:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 2696 states and 3112 transitions. [2024-11-25 02:18:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3112 transitions. [2024-11-25 02:18:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 02:18:45,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:45,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 02:18:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 2703 states and 3122 transitions. [2024-11-25 02:18:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3122 transitions. [2024-11-25 02:18:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 02:18:48,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:48,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 02:18:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 2710 states and 3131 transitions. [2024-11-25 02:18:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3131 transitions. [2024-11-25 02:18:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 02:18:50,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 02:18:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 2713 states and 3133 transitions. [2024-11-25 02:18:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3133 transitions. [2024-11-25 02:18:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 02:18:52,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 02:18:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 2718 states and 3137 transitions. [2024-11-25 02:18:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3137 transitions. [2024-11-25 02:18:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 02:18:53,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 02:18:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 2723 states and 3141 transitions. [2024-11-25 02:18:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3141 transitions. [2024-11-25 02:18:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 02:18:54,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:54,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 02:18:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 2724 states and 3142 transitions. [2024-11-25 02:18:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3142 transitions. [2024-11-25 02:18:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-25 02:18:55,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:18:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-25 02:18:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2154 states and 2463 transitions. [2024-11-25 02:18:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2463 transitions. [2024-11-25 02:18:56,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 02:18:56,185 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 145 iterations. [2024-11-25 02:18:56,193 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 02:19:19,580 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,583 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,583 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,583 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,583 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,584 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,584 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,584 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,584 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,584 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,584 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,584 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,585 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,585 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,585 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,585 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,585 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,585 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,586 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,586 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,586 INFO L77 FloydHoareUtils]: At program point L583-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not (= 7 ~a17~0)) .cse1) (and (= ~a25~0 1) .cse1)))) [2024-11-25 02:19:19,586 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,586 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,586 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,591 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,591 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,591 INFO L77 FloydHoareUtils]: At program point L586-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not (= 7 ~a17~0)) .cse1) (and (= ~a25~0 1) .cse1)))) [2024-11-25 02:19:19,591 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,591 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 02:19:19,591 INFO L75 FloydHoareUtils]: For program point L587(line 587) no Hoare annotation was computed. [2024-11-25 02:19:19,592 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,592 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,592 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,592 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,592 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,592 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,593 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,593 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,593 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,593 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 587) no Hoare annotation was computed. [2024-11-25 02:19:19,593 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,593 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,594 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,594 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,594 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,594 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,594 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,595 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,595 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,595 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,595 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,595 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,595 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,595 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,595 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,596 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,596 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,596 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,596 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-25 02:19:19,596 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,596 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,596 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,596 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,596 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,596 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,597 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,597 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,597 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,597 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,597 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,597 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,597 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,600 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,600 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,601 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,601 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,601 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,601 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 02:19:19,601 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,601 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,602 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,602 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,602 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,602 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 02:19:19,602 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 02:19:19,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 02:19:19 ImpRootNode [2024-11-25 02:19:19,624 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 02:19:19,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 02:19:19,625 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 02:19:19,625 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 02:19:19,626 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:15:40" (3/4) ... [2024-11-25 02:19:19,629 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 02:19:19,657 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2024-11-25 02:19:19,658 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-25 02:19:19,658 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-25 02:19:19,659 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 02:19:19,791 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 02:19:19,792 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 02:19:19,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 02:19:19,793 INFO L158 Benchmark]: Toolchain (without parser) took 221426.82ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 91.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 565.7MB. Max. memory is 16.1GB. [2024-11-25 02:19:19,793 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:19:19,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.53ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 64.4MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 02:19:19,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.62ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 59.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:19:19,794 INFO L158 Benchmark]: Boogie Preprocessor took 74.26ms. Allocated memory is still 117.4MB. Free memory was 59.4MB in the beginning and 55.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:19:19,794 INFO L158 Benchmark]: RCFGBuilder took 1807.48ms. Allocated memory is still 117.4MB. Free memory was 55.2MB in the beginning and 28.1MB in the end (delta: 27.1MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2024-11-25 02:19:19,795 INFO L158 Benchmark]: CodeCheck took 218658.07ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 28.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 496.8MB. Max. memory is 16.1GB. [2024-11-25 02:19:19,795 INFO L158 Benchmark]: Witness Printer took 167.05ms. Allocated memory is still 2.6GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:19:19,797 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: 195.2s, OverallIterations: 145, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 418595 SdHoareTripleChecker+Valid, 1158.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 406293 mSDsluCounter, 51194 SdHoareTripleChecker+Invalid, 985.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43366 mSDsCounter, 93406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868902 IncrementalHoareTripleChecker+Invalid, 962308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93406 mSolverCounterUnsat, 7828 mSDtfsCounter, 868902 mSolverCounterSat, 11.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173014 GetRequests, 163345 SyntacticMatches, 8527 SemanticMatches, 1142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826184 ImplicationChecksByTransitivity, 144.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 25474 NumberOfCodeBlocks, 25474 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 25330 ConstructedInterpolants, 0 QuantifiedInterpolants, 79134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 144 InterpolantComputations, 122 PerfectInterpolantSequences, 19961/21093 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: 587]: 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: ((((((a17 <= 8) && (a19 == 1)) || ((7 != a17) && (a19 != 1))) || ((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17))) || (((((7 == a28) && (a25 == a11)) && (a21 == 1)) && (a11 == a19)) && (a11 != 1))) || ((a25 == 1) && (a19 != 1))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((a17 <= 8) && (a19 == 1)) || ((7 != a17) && (a19 != 1))) || ((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17))) || (((((7 == a28) && (a25 == a11)) && (a21 == 1)) && (a11 == a19)) && (a11 != 1))) || ((a25 == 1) && (a19 != 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.53ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 64.4MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.62ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 59.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.26ms. Allocated memory is still 117.4MB. Free memory was 59.4MB in the beginning and 55.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1807.48ms. Allocated memory is still 117.4MB. Free memory was 55.2MB in the beginning and 28.1MB in the end (delta: 27.1MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * CodeCheck took 218658.07ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 28.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 496.8MB. Max. memory is 16.1GB. * Witness Printer took 167.05ms. Allocated memory is still 2.6GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 02:19:19,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d349ae6f-68eb-4559-b75f-462a6152f664/bin/ukojak-verify-ENZ3QT5qd3/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