./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label06.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_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label06.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7bcb93b552ce7a7abd40e75144bf36530dd0bd3debdf81ac1c4bfcf0afb0025b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 01:19:28,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 01:19:28,222 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 01:19:28,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 01:19:28,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 01:19:28,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 01:19:28,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 01:19:28,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 01:19:28,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 01:19:28,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 01:19:28,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 01:19:28,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 01:19:28,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 01:19:28,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 01:19:28,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 01:19:28,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 01:19:28,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 01:19:28,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 01:19:28,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 01:19:28,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 01:19:28,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 01:19:28,250 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 01:19:28,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 01:19:28,250 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 01:19:28,250 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 01:19:28,250 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 01:19:28,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 01:19:28,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:19:28,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 01:19:28,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 01:19:28,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 01:19:28,251 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 01:19:28,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 01:19:28,251 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_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7bcb93b552ce7a7abd40e75144bf36530dd0bd3debdf81ac1c4bfcf0afb0025b [2024-12-06 01:19:28,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 01:19:28,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 01:19:28,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 01:19:28,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 01:19:28,494 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 01:19:28,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label06.c [2024-12-06 01:19:31,179 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/data/1e04172fc/2c6fc0183a924b299fa6c5ef2c198622/FLAGc2a87f5c1 [2024-12-06 01:19:31,439 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 01:19:31,440 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/sv-benchmarks/c/eca-rers2012/Problem01_label06.c [2024-12-06 01:19:31,450 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/data/1e04172fc/2c6fc0183a924b299fa6c5ef2c198622/FLAGc2a87f5c1 [2024-12-06 01:19:31,465 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/data/1e04172fc/2c6fc0183a924b299fa6c5ef2c198622 [2024-12-06 01:19:31,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 01:19:31,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 01:19:31,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 01:19:31,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 01:19:31,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 01:19:31,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b0612f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31, skipping insertion in model container [2024-12-06 01:19:31,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 01:19:31,748 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_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/sv-benchmarks/c/eca-rers2012/Problem01_label06.c[20964,20977] [2024-12-06 01:19:31,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:19:31,775 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 01:19:31,846 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_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/sv-benchmarks/c/eca-rers2012/Problem01_label06.c[20964,20977] [2024-12-06 01:19:31,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:19:31,867 INFO L204 MainTranslator]: Completed translation [2024-12-06 01:19:31,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31 WrapperNode [2024-12-06 01:19:31,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 01:19:31,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 01:19:31,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 01:19:31,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 01:19:31,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,919 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 01:19:31,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 01:19:31,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 01:19:31,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 01:19:31,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 01:19:31,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,947 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 01:19:31,968 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 01:19:31,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 01:19:31,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 01:19:31,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:31" (1/1) ... [2024-12-06 01:19:31,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:19:31,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 01:19:31,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 01:19:32,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 01:19:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 01:19:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 01:19:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 01:19:32,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 01:19:32,085 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 01:19:32,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 01:19:32,883 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 01:19:32,883 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 01:19:33,118 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 01:19:33,118 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 01:19:33,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:19:33 BoogieIcfgContainer [2024-12-06 01:19:33,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 01:19:33,119 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 01:19:33,119 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 01:19:33,128 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 01:19:33,128 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:19:33" (1/1) ... [2024-12-06 01:19:33,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 01:19:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 01:19:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 01:19:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 01:19:33,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-12-06 01:19:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-12-06 01:19:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 01:19:34,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 218 states and 307 transitions. [2024-12-06 01:19:35,533 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 307 transitions. [2024-12-06 01:19:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 01:19:35,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 223 states and 315 transitions. [2024-12-06 01:19:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 315 transitions. [2024-12-06 01:19:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 01:19:35,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:35,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 295 states and 389 transitions. [2024-12-06 01:19:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 389 transitions. [2024-12-06 01:19:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-06 01:19:37,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 298 states and 393 transitions. [2024-12-06 01:19:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 393 transitions. [2024-12-06 01:19:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-06 01:19:37,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 299 states and 395 transitions. [2024-12-06 01:19:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 395 transitions. [2024-12-06 01:19:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 01:19:37,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 307 states and 410 transitions. [2024-12-06 01:19:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 410 transitions. [2024-12-06 01:19:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-06 01:19:38,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:38,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:38,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 310 states and 414 transitions. [2024-12-06 01:19:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 414 transitions. [2024-12-06 01:19:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 01:19:38,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:19:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 314 states and 423 transitions. [2024-12-06 01:19:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2024-12-06 01:19:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 01:19:38,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:19:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 317 states and 427 transitions. [2024-12-06 01:19:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 427 transitions. [2024-12-06 01:19:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 01:19:39,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 328 states and 444 transitions. [2024-12-06 01:19:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 444 transitions. [2024-12-06 01:19:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 01:19:39,607 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 334 states and 454 transitions. [2024-12-06 01:19:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 454 transitions. [2024-12-06 01:19:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 01:19:40,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:40,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 338 states and 458 transitions. [2024-12-06 01:19:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 458 transitions. [2024-12-06 01:19:40,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 01:19:40,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:40,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 344 states and 467 transitions. [2024-12-06 01:19:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 467 transitions. [2024-12-06 01:19:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 01:19:40,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 348 states and 473 transitions. [2024-12-06 01:19:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 473 transitions. [2024-12-06 01:19:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 01:19:41,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 352 states and 479 transitions. [2024-12-06 01:19:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 479 transitions. [2024-12-06 01:19:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-06 01:19:41,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 362 states and 492 transitions. [2024-12-06 01:19:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 492 transitions. [2024-12-06 01:19:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-06 01:19:42,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:42,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 365 states and 496 transitions. [2024-12-06 01:19:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 496 transitions. [2024-12-06 01:19:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-06 01:19:42,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:42,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 367 states and 499 transitions. [2024-12-06 01:19:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 499 transitions. [2024-12-06 01:19:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 01:19:43,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 370 states and 503 transitions. [2024-12-06 01:19:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 503 transitions. [2024-12-06 01:19:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 01:19:43,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:43,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 371 states and 503 transitions. [2024-12-06 01:19:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 503 transitions. [2024-12-06 01:19:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 01:19:43,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:43,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 378 states and 511 transitions. [2024-12-06 01:19:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 511 transitions. [2024-12-06 01:19:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 01:19:43,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 386 states and 520 transitions. [2024-12-06 01:19:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 520 transitions. [2024-12-06 01:19:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 01:19:44,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:44,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 388 states and 523 transitions. [2024-12-06 01:19:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 523 transitions. [2024-12-06 01:19:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 01:19:44,221 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:44,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:19:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 395 states and 530 transitions. [2024-12-06 01:19:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 530 transitions. [2024-12-06 01:19:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 01:19:44,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 404 states and 540 transitions. [2024-12-06 01:19:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 540 transitions. [2024-12-06 01:19:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-06 01:19:44,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:44,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 410 states and 546 transitions. [2024-12-06 01:19:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 546 transitions. [2024-12-06 01:19:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 01:19:44,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:44,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 427 states and 564 transitions. [2024-12-06 01:19:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 564 transitions. [2024-12-06 01:19:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 01:19:45,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 428 states and 566 transitions. [2024-12-06 01:19:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 566 transitions. [2024-12-06 01:19:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 01:19:45,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:45,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 431 states and 570 transitions. [2024-12-06 01:19:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 570 transitions. [2024-12-06 01:19:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 01:19:45,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 437 states and 576 transitions. [2024-12-06 01:19:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 576 transitions. [2024-12-06 01:19:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 01:19:45,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 438 states and 578 transitions. [2024-12-06 01:19:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 578 transitions. [2024-12-06 01:19:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 01:19:45,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:19:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 458 states and 599 transitions. [2024-12-06 01:19:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 599 transitions. [2024-12-06 01:19:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-06 01:19:45,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:19:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 459 states and 601 transitions. [2024-12-06 01:19:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 601 transitions. [2024-12-06 01:19:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-06 01:19:46,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 462 states and 604 transitions. [2024-12-06 01:19:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 604 transitions. [2024-12-06 01:19:46,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 01:19:46,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 465 states and 610 transitions. [2024-12-06 01:19:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 610 transitions. [2024-12-06 01:19:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 01:19:46,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:19:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 466 states and 610 transitions. [2024-12-06 01:19:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 610 transitions. [2024-12-06 01:19:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 01:19:46,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:46,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 568 states and 724 transitions. [2024-12-06 01:19:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 724 transitions. [2024-12-06 01:19:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 01:19:48,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 571 states and 727 transitions. [2024-12-06 01:19:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 727 transitions. [2024-12-06 01:19:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 01:19:48,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 573 states and 730 transitions. [2024-12-06 01:19:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 730 transitions. [2024-12-06 01:19:48,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 01:19:48,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 576 states and 735 transitions. [2024-12-06 01:19:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 735 transitions. [2024-12-06 01:19:49,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 01:19:49,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 01:19:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 582 states and 743 transitions. [2024-12-06 01:19:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 743 transitions. [2024-12-06 01:19:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 01:19:49,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:19:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 584 states and 745 transitions. [2024-12-06 01:19:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 745 transitions. [2024-12-06 01:19:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 01:19:49,739 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:49,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 593 states and 754 transitions. [2024-12-06 01:19:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 754 transitions. [2024-12-06 01:19:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 01:19:49,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 628 states and 792 transitions. [2024-12-06 01:19:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 792 transitions. [2024-12-06 01:19:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-06 01:19:50,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:50,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 636 states and 802 transitions. [2024-12-06 01:19:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 802 transitions. [2024-12-06 01:19:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 01:19:51,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 650 states and 819 transitions. [2024-12-06 01:19:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 819 transitions. [2024-12-06 01:19:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 01:19:51,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 762 states and 948 transitions. [2024-12-06 01:19:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 948 transitions. [2024-12-06 01:19:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 01:19:54,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 765 states and 951 transitions. [2024-12-06 01:19:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 951 transitions. [2024-12-06 01:19:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 01:19:54,621 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:54,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 771 states and 960 transitions. [2024-12-06 01:19:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 960 transitions. [2024-12-06 01:19:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 01:19:55,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 773 states and 961 transitions. [2024-12-06 01:19:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 961 transitions. [2024-12-06 01:19:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 01:19:55,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:19:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 788 states and 988 transitions. [2024-12-06 01:19:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 988 transitions. [2024-12-06 01:19:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-06 01:19:57,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:19:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 799 states and 998 transitions. [2024-12-06 01:19:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 998 transitions. [2024-12-06 01:19:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-06 01:19:57,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:57,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 807 states and 1010 transitions. [2024-12-06 01:19:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1010 transitions. [2024-12-06 01:19:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-12-06 01:19:57,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:57,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 808 states and 1011 transitions. [2024-12-06 01:19:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1011 transitions. [2024-12-06 01:19:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 01:19:57,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:19:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 815 states and 1020 transitions. [2024-12-06 01:19:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1020 transitions. [2024-12-06 01:19:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 01:19:58,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:19:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 820 states and 1026 transitions. [2024-12-06 01:19:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1026 transitions. [2024-12-06 01:19:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 01:19:58,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:58,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:19:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 823 states and 1029 transitions. [2024-12-06 01:19:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1029 transitions. [2024-12-06 01:19:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 01:19:58,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:58,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:19:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-12-06 01:19:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:19:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 832 states and 1039 transitions. [2024-12-06 01:19:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1039 transitions. [2024-12-06 01:19:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 01:19:59,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:19:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:19:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 853 states and 1066 transitions. [2024-12-06 01:20:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1066 transitions. [2024-12-06 01:20:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 01:20:01,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:01,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 944 states and 1167 transitions. [2024-12-06 01:20:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1167 transitions. [2024-12-06 01:20:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 01:20:02,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 01:20:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 947 states and 1168 transitions. [2024-12-06 01:20:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1168 transitions. [2024-12-06 01:20:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 01:20:02,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:02,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:20:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 950 states and 1173 transitions. [2024-12-06 01:20:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1173 transitions. [2024-12-06 01:20:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 01:20:03,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-06 01:20:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 960 states and 1185 transitions. [2024-12-06 01:20:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1185 transitions. [2024-12-06 01:20:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 01:20:04,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:04,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:20:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 963 states and 1189 transitions. [2024-12-06 01:20:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1189 transitions. [2024-12-06 01:20:04,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 01:20:04,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:04,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:04,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 966 states and 1193 transitions. [2024-12-06 01:20:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1193 transitions. [2024-12-06 01:20:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 01:20:04,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:04,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 62 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 967 states and 1193 transitions. [2024-12-06 01:20:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1193 transitions. [2024-12-06 01:20:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 01:20:04,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 982 states and 1210 transitions. [2024-12-06 01:20:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1210 transitions. [2024-12-06 01:20:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 01:20:04,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:04,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 64 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1021 states and 1259 transitions. [2024-12-06 01:20:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1259 transitions. [2024-12-06 01:20:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 01:20:07,020 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:07,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1024 states and 1263 transitions. [2024-12-06 01:20:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1263 transitions. [2024-12-06 01:20:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 01:20:07,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-12-06 01:20:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1031 states and 1270 transitions. [2024-12-06 01:20:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1270 transitions. [2024-12-06 01:20:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 01:20:07,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 01:20:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1114 states and 1363 transitions. [2024-12-06 01:20:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1363 transitions. [2024-12-06 01:20:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 01:20:09,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1120 states and 1369 transitions. [2024-12-06 01:20:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1369 transitions. [2024-12-06 01:20:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 01:20:10,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-06 01:20:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1123 states and 1373 transitions. [2024-12-06 01:20:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1373 transitions. [2024-12-06 01:20:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 01:20:10,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:10,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-12-06 01:20:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1125 states and 1375 transitions. [2024-12-06 01:20:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1375 transitions. [2024-12-06 01:20:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 01:20:11,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:11,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1135 states and 1387 transitions. [2024-12-06 01:20:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1387 transitions. [2024-12-06 01:20:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 01:20:11,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:11,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 01:20:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1270 states and 1534 transitions. [2024-12-06 01:20:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1534 transitions. [2024-12-06 01:20:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 01:20:14,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:14,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 01:20:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1276 states and 1544 transitions. [2024-12-06 01:20:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1544 transitions. [2024-12-06 01:20:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 01:20:15,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:15,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1294 states and 1568 transitions. [2024-12-06 01:20:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1568 transitions. [2024-12-06 01:20:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-06 01:20:16,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 01:20:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1295 states and 1569 transitions. [2024-12-06 01:20:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1569 transitions. [2024-12-06 01:20:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-06 01:20:16,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:16,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 01:20:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1297 states and 1572 transitions. [2024-12-06 01:20:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1572 transitions. [2024-12-06 01:20:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 01:20:16,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:16,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 01:20:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1310 states and 1589 transitions. [2024-12-06 01:20:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1589 transitions. [2024-12-06 01:20:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-06 01:20:18,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:18,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 01:20:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1313 states and 1592 transitions. [2024-12-06 01:20:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1592 transitions. [2024-12-06 01:20:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-06 01:20:18,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:20:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1319 states and 1600 transitions. [2024-12-06 01:20:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1600 transitions. [2024-12-06 01:20:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-06 01:20:19,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:19,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 97 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1335 states and 1621 transitions. [2024-12-06 01:20:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1621 transitions. [2024-12-06 01:20:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-06 01:20:20,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:20,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 97 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1343 states and 1629 transitions. [2024-12-06 01:20:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1629 transitions. [2024-12-06 01:20:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-06 01:20:20,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:20,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 97 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1350 states and 1635 transitions. [2024-12-06 01:20:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1635 transitions. [2024-12-06 01:20:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 01:20:21,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 01:20:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1351 states and 1636 transitions. [2024-12-06 01:20:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1636 transitions. [2024-12-06 01:20:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-06 01:20:21,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 116 proven. 34 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 01:20:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1352 states and 1637 transitions. [2024-12-06 01:20:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1637 transitions. [2024-12-06 01:20:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 01:20:22,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:22,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 01:20:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1358 states and 1644 transitions. [2024-12-06 01:20:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1644 transitions. [2024-12-06 01:20:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 01:20:22,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:22,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 01:20:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1359 states and 1644 transitions. [2024-12-06 01:20:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1644 transitions. [2024-12-06 01:20:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-12-06 01:20:22,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 01:20:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1366 states and 1653 transitions. [2024-12-06 01:20:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1653 transitions. [2024-12-06 01:20:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-12-06 01:20:23,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:23,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 102 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1381 states and 1673 transitions. [2024-12-06 01:20:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1673 transitions. [2024-12-06 01:20:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-12-06 01:20:24,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:24,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 102 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1401 states and 1704 transitions. [2024-12-06 01:20:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1704 transitions. [2024-12-06 01:20:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-12-06 01:20:28,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:28,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 102 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1410 states and 1712 transitions. [2024-12-06 01:20:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1712 transitions. [2024-12-06 01:20:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-12-06 01:20:29,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-12-06 01:20:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1412 states and 1715 transitions. [2024-12-06 01:20:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1715 transitions. [2024-12-06 01:20:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 01:20:29,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 01:20:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1432 states and 1740 transitions. [2024-12-06 01:20:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1740 transitions. [2024-12-06 01:20:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 01:20:30,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:30,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 01:20:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1434 states and 1746 transitions. [2024-12-06 01:20:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1746 transitions. [2024-12-06 01:20:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-12-06 01:20:31,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:31,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 117 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 01:20:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1492 states and 1817 transitions. [2024-12-06 01:20:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1817 transitions. [2024-12-06 01:20:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 01:20:34,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:34,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1514 states and 1838 transitions. [2024-12-06 01:20:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1838 transitions. [2024-12-06 01:20:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 01:20:36,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1522 states and 1844 transitions. [2024-12-06 01:20:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1844 transitions. [2024-12-06 01:20:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 01:20:37,020 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:37,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 57 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1574 states and 1924 transitions. [2024-12-06 01:20:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1924 transitions. [2024-12-06 01:20:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 01:20:42,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1575 states and 1925 transitions. [2024-12-06 01:20:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1925 transitions. [2024-12-06 01:20:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 01:20:42,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:42,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 57 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1589 states and 1938 transitions. [2024-12-06 01:20:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1938 transitions. [2024-12-06 01:20:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 01:20:44,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:44,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 57 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1598 states and 1948 transitions. [2024-12-06 01:20:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1948 transitions. [2024-12-06 01:20:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 01:20:45,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:45,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 57 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:20:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1605 states and 1953 transitions. [2024-12-06 01:20:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1953 transitions. [2024-12-06 01:20:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 01:20:46,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 01:20:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1622 states and 1975 transitions. [2024-12-06 01:20:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1975 transitions. [2024-12-06 01:20:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-12-06 01:20:48,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:49,393 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 115 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 1671 states and 2043 transitions. [2024-12-06 01:20:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2043 transitions. [2024-12-06 01:20:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-12-06 01:20:53,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:53,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 115 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 1683 states and 2056 transitions. [2024-12-06 01:20:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2056 transitions. [2024-12-06 01:20:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-12-06 01:20:54,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:54,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 115 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1695 states and 2069 transitions. [2024-12-06 01:20:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2069 transitions. [2024-12-06 01:20:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 01:20:55,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 123 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:20:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:20:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 1743 states and 2129 transitions. [2024-12-06 01:20:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2129 transitions. [2024-12-06 01:20:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 01:20:59,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:20:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:20:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:20:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 123 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:21:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 1748 states and 2134 transitions. [2024-12-06 01:21:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2134 transitions. [2024-12-06 01:21:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 01:21:00,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 123 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:21:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 1751 states and 2137 transitions. [2024-12-06 01:21:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2137 transitions. [2024-12-06 01:21:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 01:21:01,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:01,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-06 01:21:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1754 states and 2140 transitions. [2024-12-06 01:21:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2140 transitions. [2024-12-06 01:21:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 01:21:01,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-06 01:21:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1755 states and 2140 transitions. [2024-12-06 01:21:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2140 transitions. [2024-12-06 01:21:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 01:21:01,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:01,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-06 01:21:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 1757 states and 2142 transitions. [2024-12-06 01:21:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2142 transitions. [2024-12-06 01:21:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 01:21:02,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-06 01:21:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 1765 states and 2147 transitions. [2024-12-06 01:21:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2147 transitions. [2024-12-06 01:21:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-06 01:21:03,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 115 proven. 9 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 01:21:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1768 states and 2149 transitions. [2024-12-06 01:21:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2149 transitions. [2024-12-06 01:21:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-06 01:21:03,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:03,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-06 01:21:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 1793 states and 2177 transitions. [2024-12-06 01:21:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2177 transitions. [2024-12-06 01:21:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-06 01:21:05,659 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:05,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-06 01:21:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 1800 states and 2184 transitions. [2024-12-06 01:21:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2184 transitions. [2024-12-06 01:21:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 01:21:06,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:06,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 01:21:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 1813 states and 2200 transitions. [2024-12-06 01:21:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2200 transitions. [2024-12-06 01:21:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 01:21:07,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 01:21:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 1828 states and 2218 transitions. [2024-12-06 01:21:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2218 transitions. [2024-12-06 01:21:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 01:21:09,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:09,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 01:21:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 1830 states and 2220 transitions. [2024-12-06 01:21:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2220 transitions. [2024-12-06 01:21:10,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 01:21:10,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 01:21:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 1843 states and 2232 transitions. [2024-12-06 01:21:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2232 transitions. [2024-12-06 01:21:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 01:21:11,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 01:21:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 1848 states and 2236 transitions. [2024-12-06 01:21:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2236 transitions. [2024-12-06 01:21:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-12-06 01:21:11,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:11,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 64 proven. 119 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 01:21:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 1959 states and 2383 transitions. [2024-12-06 01:21:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2383 transitions. [2024-12-06 01:21:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 01:21:18,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:18,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 01:21:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 1971 states and 2402 transitions. [2024-12-06 01:21:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2402 transitions. [2024-12-06 01:21:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 01:21:19,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:19,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 01:21:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 1974 states and 2405 transitions. [2024-12-06 01:21:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2405 transitions. [2024-12-06 01:21:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 01:21:19,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 01:21:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2044 states and 2483 transitions. [2024-12-06 01:21:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2483 transitions. [2024-12-06 01:21:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-06 01:21:20,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-06 01:21:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2045 states and 2483 transitions. [2024-12-06 01:21:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2483 transitions. [2024-12-06 01:21:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 01:21:21,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 01:21:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2055 states and 2493 transitions. [2024-12-06 01:21:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2493 transitions. [2024-12-06 01:21:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-06 01:21:22,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:22,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 01:21:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2109 states and 2554 transitions. [2024-12-06 01:21:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2554 transitions. [2024-12-06 01:21:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-12-06 01:21:25,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 60 proven. 207 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 01:21:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2130 states and 2577 transitions. [2024-12-06 01:21:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2577 transitions. [2024-12-06 01:21:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 01:21:27,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 60 proven. 214 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 01:21:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2137 states and 2584 transitions. [2024-12-06 01:21:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2584 transitions. [2024-12-06 01:21:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:21:27,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:27,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 121 proven. 147 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 01:21:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2158 states and 2608 transitions. [2024-12-06 01:21:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2608 transitions. [2024-12-06 01:21:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-06 01:21:29,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 60 proven. 217 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 01:21:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2161 states and 2612 transitions. [2024-12-06 01:21:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2612 transitions. [2024-12-06 01:21:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-06 01:21:30,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-06 01:21:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2169 states and 2617 transitions. [2024-12-06 01:21:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2617 transitions. [2024-12-06 01:21:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-06 01:21:31,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-06 01:21:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2171 states and 2619 transitions. [2024-12-06 01:21:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2619 transitions. [2024-12-06 01:21:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-06 01:21:31,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:31,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-06 01:21:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2176 states and 2624 transitions. [2024-12-06 01:21:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2624 transitions. [2024-12-06 01:21:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-06 01:21:31,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:31,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-12-06 01:21:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2208 states and 2676 transitions. [2024-12-06 01:21:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2676 transitions. [2024-12-06 01:21:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-06 01:21:36,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-12-06 01:21:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2241 states and 2714 transitions. [2024-12-06 01:21:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 2714 transitions. [2024-12-06 01:21:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-12-06 01:21:40,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-12-06 01:21:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2246 states and 2720 transitions. [2024-12-06 01:21:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2720 transitions. [2024-12-06 01:21:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 01:21:41,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-12-06 01:21:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2316 states and 2792 transitions. [2024-12-06 01:21:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 2792 transitions. [2024-12-06 01:21:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 01:21:42,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:42,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-12-06 01:21:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2317 states and 2792 transitions. [2024-12-06 01:21:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2792 transitions. [2024-12-06 01:21:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-12-06 01:21:42,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:21:42,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:21:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:21:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 130 proven. 383 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-12-06 01:21:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:21:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2263 states and 2751 transitions. [2024-12-06 01:21:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2751 transitions. [2024-12-06 01:21:46,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 01:21:46,247 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 146 iterations. [2024-12-06 01:21:46,254 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 01:22:09,264 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,264 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,264 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,265 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,265 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,265 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,265 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,265 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,266 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,266 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,266 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,266 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,266 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,266 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,266 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,266 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,267 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,267 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,267 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,267 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,267 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,267 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,268 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,268 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse0 (= ~a8~0 15)) (.cse3 (= ~a20~0 1)) (.cse4 (= ~a17~0 1)) (.cse5 (= ~a12~0 8)) (.cse6 (= ~a21~0 1)) (.cse7 (= ~a20~0 ~a7~0)) (.cse2 (<= 15 ~a8~0)) (.cse1 (= ~a8~0 13))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse0) (and (not .cse1) (< ~a8~0 15)) (and (not .cse0) .cse2) (and (not .cse3) .cse2) (and .cse1 .cse3) (and .cse4 .cse3) (and .cse5 .cse6 .cse4 .cse7) (and (not (and .cse5 .cse6 (= ~a7~0 0))) .cse2) (and .cse5 .cse6 .cse7 (= ~a17~0 ~a7~0)) (and (not (= ~a16~0 6)) .cse2) (and (not (= 5 ~a16~0)) .cse1))) [2024-12-06 01:22:09,268 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,268 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,268 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,268 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,268 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,269 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,269 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,269 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,269 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,269 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,269 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,269 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse0 (= ~a8~0 15)) (.cse3 (= ~a20~0 1)) (.cse4 (= ~a17~0 1)) (.cse5 (= ~a12~0 8)) (.cse6 (= ~a21~0 1)) (.cse7 (= ~a20~0 ~a7~0)) (.cse2 (<= 15 ~a8~0)) (.cse1 (= ~a8~0 13))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse0) (and (not .cse1) (< ~a8~0 15)) (and (not .cse0) .cse2) (and (not .cse3) .cse2) (and .cse1 .cse3) (and .cse4 .cse3) (and .cse5 .cse6 .cse4 .cse7) (and (not (and .cse5 .cse6 (= ~a7~0 0))) .cse2) (and .cse5 .cse6 .cse7 (= ~a17~0 ~a7~0)) (and (not (= ~a16~0 6)) .cse2) (and (not (= 5 ~a16~0)) .cse1))) [2024-12-06 01:22:09,270 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,270 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,270 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,270 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,270 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,270 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,270 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,270 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,270 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,271 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,271 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 01:22:09,271 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse0 (= ~a8~0 15)) (.cse3 (= ~a20~0 1)) (.cse4 (= ~a17~0 1)) (.cse5 (= ~a12~0 8)) (.cse6 (= ~a21~0 1)) (.cse7 (= ~a20~0 ~a7~0)) (.cse2 (<= 15 ~a8~0)) (.cse1 (= ~a8~0 13))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse0) (and (not .cse1) (< ~a8~0 15)) (and (not .cse0) .cse2) (and (not .cse3) .cse2) (and .cse1 .cse3) (and .cse4 .cse3) (and .cse5 .cse6 .cse4 .cse7) (and (not (and .cse5 .cse6 (= ~a7~0 0))) .cse2) (and .cse5 .cse6 .cse7 (= ~a17~0 ~a7~0)) (and (not (= ~a16~0 6)) .cse2) (and (not (= 5 ~a16~0)) .cse1))) [2024-12-06 01:22:09,271 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 01:22:09,271 INFO L77 FloydHoareUtils]: At program point L554-1(lines 40 585) the Hoare annotation is: (not (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13))) [2024-12-06 01:22:09,271 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,271 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,271 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,271 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,272 INFO L77 FloydHoareUtils]: At program point L557-1(lines 40 585) the Hoare annotation is: (not (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13))) [2024-12-06 01:22:09,272 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,272 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,272 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,272 INFO L75 FloydHoareUtils]: For program point L558(line 558) no Hoare annotation was computed. [2024-12-06 01:22:09,272 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 01:22:09,272 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,272 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,272 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,272 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,273 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,273 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,273 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,273 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,273 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,273 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 558) no Hoare annotation was computed. [2024-12-06 01:22:09,273 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,273 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,273 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,274 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,274 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse2 (= ~a20~0 ~a7~0))) (and (not (= ~a20~0 1)) (= 5 ~a16~0) (= ~a8~0 13) (not (and .cse0 .cse1 (= ~a17~0 1) .cse2)) (not (and .cse0 .cse1 .cse2 (= ~a17~0 ~a7~0)))))) [2024-12-06 01:22:09,274 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4)) (.cse4 (= ~a20~0 1)) (.cse5 (= ~a17~0 1)) (.cse2 (<= 15 ~a8~0)) (.cse6 (= ~a12~0 8)) (.cse7 (= ~a21~0 1)) (.cse8 (= ~a20~0 ~a7~0)) (.cse0 (= ~a17~0 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse3 (= ~a8~0 13))) (or (and (not (and .cse0 .cse1)) (<= ~a16~0 5) .cse2) (and (not .cse3) (< ~a8~0 15)) (and (not (= ~a8~0 15)) .cse2) (and (not .cse4) .cse2) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse1) (and .cse5 .cse2) (and .cse3 .cse4) (and .cse6 .cse7 .cse5 .cse8) (and (not (and .cse6 .cse7 (= ~a7~0 0))) .cse2) (and .cse6 .cse7 .cse8 .cse0) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse9) (and (not .cse9) (<= 6 ~a16~0)) (and (not (= 5 ~a16~0)) .cse3))) [2024-12-06 01:22:09,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 01:22:09 ImpRootNode [2024-12-06 01:22:09,283 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 01:22:09,284 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 01:22:09,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 01:22:09,284 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 01:22:09,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:19:33" (3/4) ... [2024-12-06 01:22:09,287 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 01:22:09,298 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-12-06 01:22:09,299 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 01:22:09,300 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-06 01:22:09,301 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 01:22:09,392 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 01:22:09,392 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 01:22:09,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 01:22:09,393 INFO L158 Benchmark]: Toolchain (without parser) took 157924.77ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 115.3MB in the beginning and 696.8MB in the end (delta: -581.4MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-12-06 01:22:09,393 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:22:09,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.33ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 88.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 01:22:09,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.66ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 83.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:22:09,394 INFO L158 Benchmark]: Boogie Preprocessor took 47.70ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 79.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:22:09,394 INFO L158 Benchmark]: RCFGBuilder took 1150.73ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 65.7MB in the end (delta: 13.4MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2024-12-06 01:22:09,394 INFO L158 Benchmark]: CodeCheck took 156164.34ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 65.7MB in the beginning and 709.4MB in the end (delta: -643.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-12-06 01:22:09,395 INFO L158 Benchmark]: Witness Printer took 108.42ms. Allocated memory is still 2.0GB. Free memory was 709.4MB in the beginning and 696.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 01:22:09,396 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, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 133.1s, OverallIterations: 146, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349022 SdHoareTripleChecker+Valid, 800.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346726 mSDsluCounter, 62238 SdHoareTripleChecker+Invalid, 686.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54097 mSDsCounter, 93914 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743285 IncrementalHoareTripleChecker+Invalid, 837199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93914 mSolverCounterUnsat, 8141 mSDtfsCounter, 743285 mSolverCounterSat, 6.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154565 GetRequests, 147815 SyntacticMatches, 5580 SemanticMatches, 1170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996089 ImplicationChecksByTransitivity, 94.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 21360 NumberOfCodeBlocks, 21360 NumberOfCodeBlocksAsserted, 145 NumberOfCheckSat, 21215 ConstructedInterpolants, 0 QuantifiedInterpolants, 109334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 145 InterpolantComputations, 91 PerfectInterpolantSequences, 14639/17539 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: 558]: 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: 40]: Location Invariant Derived location invariant: !(((((a20 != 1) && (5 == a16)) && (a8 == 13)) && !((((a12 == 8) && (a21 == 1)) && (a17 == 1)) && (a20 == a7))) && !((((a12 == 8) && (a21 == 1)) && (a20 == a7)) && (a17 == a7))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((a20 != 1) && (5 == a16)) && (a8 == 13)) && !((((a12 == 8) && (a21 == 1)) && (a17 == 1)) && (a20 == a7))) && !((((a12 == 8) && (a21 == 1)) && (a20 == a7)) && (a17 == a7))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.33ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 88.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.66ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 83.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.70ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 79.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1150.73ms. Allocated memory is still 142.6MB. Free memory was 79.1MB in the beginning and 65.7MB in the end (delta: 13.4MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * CodeCheck took 156164.34ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 65.7MB in the beginning and 709.4MB in the end (delta: -643.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 108.42ms. Allocated memory is still 2.0GB. Free memory was 709.4MB in the beginning and 696.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 01:22:09,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bfa928-49b2-4bb3-8169-053b7eeaf03e/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE