./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.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_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/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_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/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_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/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 5958333028b8f64162c92b3e987d78deaf3d77dc73071d1f6edce3e1a07212a4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 00:22:32,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 00:22:32,891 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 00:22:32,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 00:22:32,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 00:22:32,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 00:22:32,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 00:22:32,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 00:22:32,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 00:22:32,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 00:22:32,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 00:22:32,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 00:22:32,916 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 00:22:32,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 00:22:32,917 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 00:22:32,917 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 00:22:32,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 00:22:32,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:22:32,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 00:22:32,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 00:22:32,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 00:22:32,918 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 00:22:32,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 00:22:32,918 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_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/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 -> 5958333028b8f64162c92b3e987d78deaf3d77dc73071d1f6edce3e1a07212a4 [2024-12-06 00:22:33,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 00:22:33,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 00:22:33,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 00:22:33,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 00:22:33,162 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 00:22:33,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2024-12-06 00:22:35,841 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/data/9829acbb2/d9bd9d410fc344f19d745ceb3d5e3530/FLAGc01c7c239 [2024-12-06 00:22:36,054 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 00:22:36,055 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2024-12-06 00:22:36,065 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/data/9829acbb2/d9bd9d410fc344f19d745ceb3d5e3530/FLAGc01c7c239 [2024-12-06 00:22:36,079 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/data/9829acbb2/d9bd9d410fc344f19d745ceb3d5e3530 [2024-12-06 00:22:36,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 00:22:36,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 00:22:36,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 00:22:36,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 00:22:36,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 00:22:36,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5daf5cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36, skipping insertion in model container [2024-12-06 00:22:36,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 00:22:36,359 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_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/sv-benchmarks/c/eca-rers2012/Problem01_label05.c[17240,17253] [2024-12-06 00:22:36,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:22:36,396 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 00:22:36,457 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_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/sv-benchmarks/c/eca-rers2012/Problem01_label05.c[17240,17253] [2024-12-06 00:22:36,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:22:36,484 INFO L204 MainTranslator]: Completed translation [2024-12-06 00:22:36,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36 WrapperNode [2024-12-06 00:22:36,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 00:22:36,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 00:22:36,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 00:22:36,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 00:22:36,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,537 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 00:22:36,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 00:22:36,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 00:22:36,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 00:22:36,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 00:22:36,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 00:22:36,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 00:22:36,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 00:22:36,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 00:22:36,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:22:36" (1/1) ... [2024-12-06 00:22:36,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:22:36,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 00:22:36,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 00:22:36,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 00:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 00:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 00:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 00:22:36,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 00:22:36,703 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 00:22:36,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 00:22:37,555 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 00:22:37,555 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 00:22:37,827 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 00:22:37,827 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 00:22:37,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:22:37 BoogieIcfgContainer [2024-12-06 00:22:37,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 00:22:37,829 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 00:22:37,829 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 00:22:37,838 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 00:22:37,839 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:22:37" (1/1) ... [2024-12-06 00:22:37,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 00:22:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 00:22:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 00:22:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 00:22:37,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:37,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:22:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2024-12-06 00:22:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2024-12-06 00:22:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 00:22:38,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:22:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2024-12-06 00:22:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2024-12-06 00:22:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 00:22:39,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:39,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:39,731 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 00:22:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2024-12-06 00:22:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2024-12-06 00:22:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 00:22:39,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:39,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 00:22:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 291 states and 425 transitions. [2024-12-06 00:22:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2024-12-06 00:22:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 00:22:40,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:40,484 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 00:22:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 307 states and 444 transitions. [2024-12-06 00:22:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 444 transitions. [2024-12-06 00:22:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-06 00:22:40,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:40,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 317 states and 457 transitions. [2024-12-06 00:22:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 457 transitions. [2024-12-06 00:22:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 00:22:41,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 00:22:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 338 states and 481 transitions. [2024-12-06 00:22:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2024-12-06 00:22:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 00:22:41,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:41,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 343 states and 489 transitions. [2024-12-06 00:22:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 489 transitions. [2024-12-06 00:22:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 00:22:42,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 353 states and 500 transitions. [2024-12-06 00:22:42,378 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 500 transitions. [2024-12-06 00:22:42,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 00:22:42,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:42,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 359 states and 506 transitions. [2024-12-06 00:22:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2024-12-06 00:22:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 00:22:42,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 00:22:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 365 states and 512 transitions. [2024-12-06 00:22:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2024-12-06 00:22:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 00:22:42,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 00:22:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 373 states and 525 transitions. [2024-12-06 00:22:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 525 transitions. [2024-12-06 00:22:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 00:22:43,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:43,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 00:22:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 382 states and 537 transitions. [2024-12-06 00:22:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 537 transitions. [2024-12-06 00:22:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 00:22:43,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:43,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 00:22:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 388 states and 544 transitions. [2024-12-06 00:22:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 544 transitions. [2024-12-06 00:22:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 00:22:43,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 00:22:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 390 states and 546 transitions. [2024-12-06 00:22:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 546 transitions. [2024-12-06 00:22:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 00:22:43,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 00:22:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 398 states and 556 transitions. [2024-12-06 00:22:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 556 transitions. [2024-12-06 00:22:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 00:22:44,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 00:22:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 400 states and 558 transitions. [2024-12-06 00:22:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 558 transitions. [2024-12-06 00:22:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 00:22:44,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:44,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 00:22:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 402 states and 560 transitions. [2024-12-06 00:22:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 560 transitions. [2024-12-06 00:22:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 00:22:44,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:44,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 413 states and 574 transitions. [2024-12-06 00:22:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 574 transitions. [2024-12-06 00:22:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 00:22:45,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:45,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 423 states and 585 transitions. [2024-12-06 00:22:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 585 transitions. [2024-12-06 00:22:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 00:22:45,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:45,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 440 states and 604 transitions. [2024-12-06 00:22:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 604 transitions. [2024-12-06 00:22:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-06 00:22:46,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 00:22:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 454 states and 618 transitions. [2024-12-06 00:22:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 618 transitions. [2024-12-06 00:22:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 00:22:46,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 00:22:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 484 states and 655 transitions. [2024-12-06 00:22:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 655 transitions. [2024-12-06 00:22:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 00:22:46,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:46,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 00:22:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 507 states and 679 transitions. [2024-12-06 00:22:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 679 transitions. [2024-12-06 00:22:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 00:22:47,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:47,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:47,663 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 00:22:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 536 states and 709 transitions. [2024-12-06 00:22:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 709 transitions. [2024-12-06 00:22:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-12-06 00:22:47,842 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 00:22:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 584 states and 761 transitions. [2024-12-06 00:22:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 761 transitions. [2024-12-06 00:22:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-06 00:22:48,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 00:22:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 598 states and 775 transitions. [2024-12-06 00:22:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 775 transitions. [2024-12-06 00:22:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 00:22:48,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:48,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 609 states and 789 transitions. [2024-12-06 00:22:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 789 transitions. [2024-12-06 00:22:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 00:22:49,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 00:22:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 638 states and 821 transitions. [2024-12-06 00:22:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 821 transitions. [2024-12-06 00:22:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 00:22:50,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 648 states and 832 transitions. [2024-12-06 00:22:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 832 transitions. [2024-12-06 00:22:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 00:22:50,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:50,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-12-06 00:22:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 662 states and 848 transitions. [2024-12-06 00:22:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 848 transitions. [2024-12-06 00:22:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 00:22:51,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:51,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:51,121 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 00:22:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 701 states and 891 transitions. [2024-12-06 00:22:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 891 transitions. [2024-12-06 00:22:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 00:22:51,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:22:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 771 states and 969 transitions. [2024-12-06 00:22:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 969 transitions. [2024-12-06 00:22:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 00:22:52,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:52,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:22:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 840 states and 1059 transitions. [2024-12-06 00:22:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1059 transitions. [2024-12-06 00:22:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 00:22:54,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:22:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 908 states and 1131 transitions. [2024-12-06 00:22:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1131 transitions. [2024-12-06 00:22:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 00:22:55,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:55,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 00:22:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 909 states and 1131 transitions. [2024-12-06 00:22:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1131 transitions. [2024-12-06 00:22:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 00:22:55,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:55,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:22:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 937 states and 1161 transitions. [2024-12-06 00:22:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1161 transitions. [2024-12-06 00:22:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 00:22:56,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 971 states and 1204 transitions. [2024-12-06 00:22:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1204 transitions. [2024-12-06 00:22:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 00:22:57,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1010 states and 1246 transitions. [2024-12-06 00:22:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1246 transitions. [2024-12-06 00:22:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 00:22:58,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:58,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:22:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1016 states and 1252 transitions. [2024-12-06 00:22:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1252 transitions. [2024-12-06 00:22:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 00:22:58,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1087 states and 1323 transitions. [2024-12-06 00:23:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1323 transitions. [2024-12-06 00:23:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-06 00:23:00,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:23:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1106 states and 1344 transitions. [2024-12-06 00:23:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1344 transitions. [2024-12-06 00:23:00,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-06 00:23:00,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:00,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:23:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1125 states and 1366 transitions. [2024-12-06 00:23:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1366 transitions. [2024-12-06 00:23:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:23:01,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:01,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-12-06 00:23:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1128 states and 1370 transitions. [2024-12-06 00:23:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1370 transitions. [2024-12-06 00:23:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:23:02,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-12-06 00:23:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1143 states and 1387 transitions. [2024-12-06 00:23:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1387 transitions. [2024-12-06 00:23:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-06 00:23:02,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:23:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1162 states and 1408 transitions. [2024-12-06 00:23:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1408 transitions. [2024-12-06 00:23:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-06 00:23:03,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:23:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1181 states and 1429 transitions. [2024-12-06 00:23:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1429 transitions. [2024-12-06 00:23:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-06 00:23:04,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:04,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 00:23:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1198 states and 1450 transitions. [2024-12-06 00:23:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1450 transitions. [2024-12-06 00:23:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-12-06 00:23:05,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:05,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 00:23:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1214 states and 1470 transitions. [2024-12-06 00:23:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1470 transitions. [2024-12-06 00:23:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-06 00:23:05,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:23:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1225 states and 1483 transitions. [2024-12-06 00:23:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1483 transitions. [2024-12-06 00:23:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-06 00:23:06,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:06,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 00:23:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1229 states and 1487 transitions. [2024-12-06 00:23:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1487 transitions. [2024-12-06 00:23:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 00:23:06,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:06,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 00:23:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:07,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1250 states and 1513 transitions. [2024-12-06 00:23:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1513 transitions. [2024-12-06 00:23:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-06 00:23:07,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:07,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 00:23:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1291 states and 1558 transitions. [2024-12-06 00:23:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1558 transitions. [2024-12-06 00:23:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-06 00:23:08,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:08,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 00:23:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1329 states and 1599 transitions. [2024-12-06 00:23:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1599 transitions. [2024-12-06 00:23:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 00:23:09,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:09,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1362 states and 1640 transitions. [2024-12-06 00:23:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1640 transitions. [2024-12-06 00:23:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 00:23:11,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1372 states and 1651 transitions. [2024-12-06 00:23:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1651 transitions. [2024-12-06 00:23:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 00:23:11,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:11,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1391 states and 1672 transitions. [2024-12-06 00:23:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1672 transitions. [2024-12-06 00:23:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 00:23:12,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1395 states and 1677 transitions. [2024-12-06 00:23:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1677 transitions. [2024-12-06 00:23:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-06 00:23:13,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:13,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 00:23:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1411 states and 1694 transitions. [2024-12-06 00:23:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1694 transitions. [2024-12-06 00:23:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-06 00:23:13,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:13,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:23:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1412 states and 1697 transitions. [2024-12-06 00:23:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1697 transitions. [2024-12-06 00:23:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 00:23:13,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:23:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1415 states and 1700 transitions. [2024-12-06 00:23:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1700 transitions. [2024-12-06 00:23:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 00:23:14,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:14,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:23:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1418 states and 1703 transitions. [2024-12-06 00:23:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1703 transitions. [2024-12-06 00:23:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-06 00:23:14,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:14,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-06 00:23:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1443 states and 1729 transitions. [2024-12-06 00:23:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1729 transitions. [2024-12-06 00:23:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-12-06 00:23:14,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-06 00:23:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1467 states and 1753 transitions. [2024-12-06 00:23:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1753 transitions. [2024-12-06 00:23:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:23:15,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:15,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1498 states and 1796 transitions. [2024-12-06 00:23:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1796 transitions. [2024-12-06 00:23:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:23:17,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1543 states and 1849 transitions. [2024-12-06 00:23:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1849 transitions. [2024-12-06 00:23:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:23:20,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:20,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1545 states and 1850 transitions. [2024-12-06 00:23:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1850 transitions. [2024-12-06 00:23:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:23:20,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:20,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1562 states and 1867 transitions. [2024-12-06 00:23:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1867 transitions. [2024-12-06 00:23:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:23:21,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1564 states and 1869 transitions. [2024-12-06 00:23:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1869 transitions. [2024-12-06 00:23:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 00:23:22,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:22,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-06 00:23:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1565 states and 1870 transitions. [2024-12-06 00:23:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1870 transitions. [2024-12-06 00:23:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 00:23:22,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:22,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-06 00:23:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1597 states and 1907 transitions. [2024-12-06 00:23:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 1907 transitions. [2024-12-06 00:23:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 00:23:23,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:23,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 00:23:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1598 states and 1908 transitions. [2024-12-06 00:23:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1908 transitions. [2024-12-06 00:23:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-12-06 00:23:23,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-06 00:23:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1627 states and 1941 transitions. [2024-12-06 00:23:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1941 transitions. [2024-12-06 00:23:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:23:24,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:24,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-06 00:23:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1646 states and 1959 transitions. [2024-12-06 00:23:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1959 transitions. [2024-12-06 00:23:25,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:23:25,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:25,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-06 00:23:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1663 states and 1976 transitions. [2024-12-06 00:23:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1976 transitions. [2024-12-06 00:23:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:23:26,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-06 00:23:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1665 states and 1977 transitions. [2024-12-06 00:23:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1977 transitions. [2024-12-06 00:23:26,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:23:26,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:26,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 00:23:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1674 states and 1986 transitions. [2024-12-06 00:23:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1986 transitions. [2024-12-06 00:23:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:23:27,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:27,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 1701 states and 2016 transitions. [2024-12-06 00:23:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2016 transitions. [2024-12-06 00:23:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:23:29,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 1723 states and 2039 transitions. [2024-12-06 00:23:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2039 transitions. [2024-12-06 00:23:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:23:30,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:30,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 1742 states and 2059 transitions. [2024-12-06 00:23:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2059 transitions. [2024-12-06 00:23:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-12-06 00:23:31,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 191 proven. 38 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-06 00:23:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 1757 states and 2075 transitions. [2024-12-06 00:23:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2075 transitions. [2024-12-06 00:23:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 00:23:32,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:32,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 00:23:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1764 states and 2082 transitions. [2024-12-06 00:23:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2082 transitions. [2024-12-06 00:23:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 00:23:33,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:33,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 00:23:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:35,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 1814 states and 2138 transitions. [2024-12-06 00:23:35,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2138 transitions. [2024-12-06 00:23:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 00:23:35,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:35,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 00:23:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 1849 states and 2176 transitions. [2024-12-06 00:23:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2176 transitions. [2024-12-06 00:23:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 00:23:37,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:37,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 00:23:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 1891 states and 2221 transitions. [2024-12-06 00:23:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2221 transitions. [2024-12-06 00:23:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 00:23:39,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:39,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 00:23:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 1894 states and 2225 transitions. [2024-12-06 00:23:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2225 transitions. [2024-12-06 00:23:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 00:23:39,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:23:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 1912 states and 2247 transitions. [2024-12-06 00:23:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2247 transitions. [2024-12-06 00:23:41,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 00:23:41,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:23:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 1963 states and 2301 transitions. [2024-12-06 00:23:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2301 transitions. [2024-12-06 00:23:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 00:23:44,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:44,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 1964 states and 2302 transitions. [2024-12-06 00:23:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2302 transitions. [2024-12-06 00:23:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 00:23:45,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:45,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 1976 states and 2317 transitions. [2024-12-06 00:23:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2317 transitions. [2024-12-06 00:23:46,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 00:23:46,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:46,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:23:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 1983 states and 2323 transitions. [2024-12-06 00:23:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2323 transitions. [2024-12-06 00:23:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 00:23:48,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:48,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 00:23:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2047 states and 2396 transitions. [2024-12-06 00:23:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2396 transitions. [2024-12-06 00:23:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 00:23:51,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 00:23:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2110 states and 2462 transitions. [2024-12-06 00:23:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2462 transitions. [2024-12-06 00:23:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 00:23:55,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:55,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:23:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2247 states and 2617 transitions. [2024-12-06 00:23:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 2617 transitions. [2024-12-06 00:23:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 00:23:59,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 00:24:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2253 states and 2624 transitions. [2024-12-06 00:24:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 2624 transitions. [2024-12-06 00:24:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 00:24:00,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2255 states and 2625 transitions. [2024-12-06 00:24:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2625 transitions. [2024-12-06 00:24:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-06 00:24:01,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:01,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:24:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2376 states and 2763 transitions. [2024-12-06 00:24:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2763 transitions. [2024-12-06 00:24:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 00:24:04,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:04,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:24:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2385 states and 2772 transitions. [2024-12-06 00:24:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 2772 transitions. [2024-12-06 00:24:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 00:24:06,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:24:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2394 states and 2781 transitions. [2024-12-06 00:24:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 2781 transitions. [2024-12-06 00:24:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-12-06 00:24:06,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-12-06 00:24:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2399 states and 2787 transitions. [2024-12-06 00:24:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 2787 transitions. [2024-12-06 00:24:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 00:24:07,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 00:24:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2401 states and 2789 transitions. [2024-12-06 00:24:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2789 transitions. [2024-12-06 00:24:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 00:24:08,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 00:24:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2403 states and 2791 transitions. [2024-12-06 00:24:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2791 transitions. [2024-12-06 00:24:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 00:24:08,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:08,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-12-06 00:24:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2404 states and 2792 transitions. [2024-12-06 00:24:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 2792 transitions. [2024-12-06 00:24:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-06 00:24:08,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-06 00:24:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2405 states and 2793 transitions. [2024-12-06 00:24:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 2793 transitions. [2024-12-06 00:24:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-06 00:24:09,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:10,098 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 00:24:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2448 states and 2844 transitions. [2024-12-06 00:24:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 2844 transitions. [2024-12-06 00:24:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-06 00:24:12,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 00:24:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2459 states and 2859 transitions. [2024-12-06 00:24:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 2859 transitions. [2024-12-06 00:24:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-12-06 00:24:13,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 171 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:24:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2484 states and 2888 transitions. [2024-12-06 00:24:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 2888 transitions. [2024-12-06 00:24:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-12-06 00:24:14,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:14,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-06 00:24:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2486 states and 2890 transitions. [2024-12-06 00:24:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 2890 transitions. [2024-12-06 00:24:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-12-06 00:24:15,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:15,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 174 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 00:24:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2491 states and 2896 transitions. [2024-12-06 00:24:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 2896 transitions. [2024-12-06 00:24:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-12-06 00:24:16,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 174 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 00:24:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2496 states and 2902 transitions. [2024-12-06 00:24:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2902 transitions. [2024-12-06 00:24:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-12-06 00:24:17,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:17,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 00:24:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2502 states and 2911 transitions. [2024-12-06 00:24:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2911 transitions. [2024-12-06 00:24:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-12-06 00:24:18,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:18,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 00:24:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2508 states and 2920 transitions. [2024-12-06 00:24:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 2920 transitions. [2024-12-06 00:24:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 00:24:20,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:20,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:24:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2516 states and 2932 transitions. [2024-12-06 00:24:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 2932 transitions. [2024-12-06 00:24:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 00:24:21,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:21,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:24:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2530 states and 2949 transitions. [2024-12-06 00:24:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 2949 transitions. [2024-12-06 00:24:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-06 00:24:22,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 190 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:24:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2532 states and 2950 transitions. [2024-12-06 00:24:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 2950 transitions. [2024-12-06 00:24:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 00:24:22,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:22,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 223 proven. 59 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:24:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2534 states and 2952 transitions. [2024-12-06 00:24:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 2952 transitions. [2024-12-06 00:24:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 00:24:23,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:23,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 00:24:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2548 states and 2968 transitions. [2024-12-06 00:24:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 2968 transitions. [2024-12-06 00:24:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 00:24:24,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:24,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:24:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 2587 states and 3012 transitions. [2024-12-06 00:24:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3012 transitions. [2024-12-06 00:24:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 00:24:26,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:26,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 196 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 00:24:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 2602 states and 3034 transitions. [2024-12-06 00:24:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3034 transitions. [2024-12-06 00:24:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 00:24:28,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:28,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 196 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 00:24:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 2617 states and 3056 transitions. [2024-12-06 00:24:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 3056 transitions. [2024-12-06 00:24:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 00:24:31,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 132 proven. 166 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-12-06 00:24:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 2707 states and 3149 transitions. [2024-12-06 00:24:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2707 states and 3149 transitions. [2024-12-06 00:24:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:24:33,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:24:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 2797 states and 3251 transitions. [2024-12-06 00:24:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3251 transitions. [2024-12-06 00:24:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:24:39,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:24:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 2855 states and 3313 transitions. [2024-12-06 00:24:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3313 transitions. [2024-12-06 00:24:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 00:24:43,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 00:24:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 2858 states and 3316 transitions. [2024-12-06 00:24:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3316 transitions. [2024-12-06 00:24:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 00:24:45,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-12-06 00:24:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 2859 states and 3317 transitions. [2024-12-06 00:24:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 3317 transitions. [2024-12-06 00:24:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:24:45,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:45,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:24:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 2902 states and 3369 transitions. [2024-12-06 00:24:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 3369 transitions. [2024-12-06 00:24:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:24:49,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:24:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 2912 states and 3382 transitions. [2024-12-06 00:24:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 3382 transitions. [2024-12-06 00:24:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:24:50,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:24:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 2933 states and 3403 transitions. [2024-12-06 00:24:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 3403 transitions. [2024-12-06 00:24:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:24:53,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:53,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:24:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 2956 states and 3427 transitions. [2024-12-06 00:24:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3427 transitions. [2024-12-06 00:24:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:24:55,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:24:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3455 states to 2981 states and 3455 transitions. [2024-12-06 00:24:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 3455 transitions. [2024-12-06 00:24:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:24:58,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:58,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3070 states and 3554 transitions. [2024-12-06 00:25:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3554 transitions. [2024-12-06 00:25:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:25:07,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:07,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3080 states and 3565 transitions. [2024-12-06 00:25:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 3565 transitions. [2024-12-06 00:25:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:25:08,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:08,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3099 states and 3584 transitions. [2024-12-06 00:25:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3584 transitions. [2024-12-06 00:25:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:25:10,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:10,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3103 states and 3588 transitions. [2024-12-06 00:25:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 3588 transitions. [2024-12-06 00:25:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 00:25:12,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 251 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:25:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3105 states and 3590 transitions. [2024-12-06 00:25:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 3590 transitions. [2024-12-06 00:25:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 00:25:12,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 00:25:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3136 states and 3623 transitions. [2024-12-06 00:25:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 3623 transitions. [2024-12-06 00:25:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 00:25:16,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-06 00:25:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3263 states and 3762 transitions. [2024-12-06 00:25:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3263 states and 3762 transitions. [2024-12-06 00:25:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 00:25:22,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:22,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:25:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3319 states and 3828 transitions. [2024-12-06 00:25:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 3828 transitions. [2024-12-06 00:25:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 00:25:26,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:26,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:25:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3329 states and 3841 transitions. [2024-12-06 00:25:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 3841 transitions. [2024-12-06 00:25:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 00:25:27,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:27,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-12-06 00:25:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3331 states and 3844 transitions. [2024-12-06 00:25:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 3844 transitions. [2024-12-06 00:25:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 00:25:28,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:28,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-12-06 00:25:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3335 states and 3848 transitions. [2024-12-06 00:25:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 3848 transitions. [2024-12-06 00:25:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 00:25:28,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:28,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-12-06 00:25:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3338 states and 3851 transitions. [2024-12-06 00:25:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 3851 transitions. [2024-12-06 00:25:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 00:25:29,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 00:25:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3468 states and 3991 transitions. [2024-12-06 00:25:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 3991 transitions. [2024-12-06 00:25:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-12-06 00:25:33,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 299 proven. 141 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-06 00:25:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4084 states to 3553 states and 4084 transitions. [2024-12-06 00:25:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4084 transitions. [2024-12-06 00:25:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-12-06 00:25:37,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 299 proven. 141 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-06 00:25:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 3575 states and 4110 transitions. [2024-12-06 00:25:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 4110 transitions. [2024-12-06 00:25:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-12-06 00:25:39,555 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:39,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 179 proven. 204 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-12-06 00:25:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 3579 states and 4113 transitions. [2024-12-06 00:25:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 4113 transitions. [2024-12-06 00:25:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-12-06 00:25:40,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 238 proven. 242 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-12-06 00:25:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 3595 states and 4129 transitions. [2024-12-06 00:25:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 4129 transitions. [2024-12-06 00:25:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-12-06 00:25:41,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:41,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 201 proven. 238 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-12-06 00:25:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3298 states and 3809 transitions. [2024-12-06 00:25:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 3809 transitions. [2024-12-06 00:25:42,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 00:25:42,059 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 149 iterations. [2024-12-06 00:25:42,067 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 00:26:00,410 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,411 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,411 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,411 INFO L77 FloydHoareUtils]: At program point L467-1(lines 40 585) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a20~0 1))) (and (not (and .cse0 (= 5 ~a16~0) .cse1 .cse2 (= ~a8~0 15))) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse1 .cse2 (= ~a16~0 4))) (= ~a7~0 1)))) [2024-12-06 00:26:00,411 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,412 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,412 INFO L75 FloydHoareUtils]: For program point L468(line 468) no Hoare annotation was computed. [2024-12-06 00:26:00,412 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,412 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,412 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,412 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,412 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,413 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,413 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,413 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,413 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,413 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,413 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,413 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,413 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,414 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,414 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,414 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,414 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,414 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,414 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,414 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,414 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,415 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,415 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,415 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,415 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,415 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,415 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,415 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,416 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,416 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,416 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,416 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,416 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,416 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,416 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,416 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,417 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,418 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,418 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,418 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,418 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,418 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 00:26:00,418 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,418 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,419 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,419 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,419 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,419 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,419 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,419 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,419 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,420 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 468) no Hoare annotation was computed. [2024-12-06 00:26:00,420 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,420 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,420 INFO L77 FloydHoareUtils]: At program point L464-1(lines 40 585) the Hoare annotation is: (or (not (= ~a21~0 1)) (not (= ~a7~0 1)) (and (= ~a12~0 8) (= ~a8~0 13) (= ~a17~0 1) (= ~a20~0 1) (= ~a16~0 4))) [2024-12-06 00:26:00,420 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,420 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,420 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,420 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-12-06 00:26:00,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 12:26:00 ImpRootNode [2024-12-06 00:26:00,431 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 00:26:00,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 00:26:00,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 00:26:00,432 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 00:26:00,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:22:37" (3/4) ... [2024-12-06 00:26:00,435 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 00:26:00,447 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-12-06 00:26:00,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-12-06 00:26:00,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-06 00:26:00,449 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 00:26:00,543 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 00:26:00,543 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 00:26:00,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 00:26:00,544 INFO L158 Benchmark]: Toolchain (without parser) took 204461.96ms. Allocated memory was 117.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 90.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 837.0MB. Max. memory is 16.1GB. [2024-12-06 00:26:00,544 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:26:00,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.74ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 63.8MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 00:26:00,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.12ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:26:00,545 INFO L158 Benchmark]: Boogie Preprocessor took 46.67ms. Allocated memory is still 117.4MB. Free memory was 58.4MB in the beginning and 54.5MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:26:00,546 INFO L158 Benchmark]: RCFGBuilder took 1243.14ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 54.3MB in the beginning and 113.7MB in the end (delta: -59.4MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-12-06 00:26:00,546 INFO L158 Benchmark]: CodeCheck took 202602.52ms. Allocated memory was 209.7MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 113.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 767.9MB. Max. memory is 16.1GB. [2024-12-06 00:26:00,546 INFO L158 Benchmark]: Witness Printer took 111.96ms. Allocated memory is still 2.4GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:26:00,548 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: 184.2s, OverallIterations: 149, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 522039 SdHoareTripleChecker+Valid, 1114.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 519838 mSDsluCounter, 78088 SdHoareTripleChecker+Invalid, 948.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66578 mSDsCounter, 147300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1156162 IncrementalHoareTripleChecker+Invalid, 1303462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147300 mSolverCounterUnsat, 11510 mSDtfsCounter, 1156162 mSolverCounterSat, 7.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187478 GetRequests, 178836 SyntacticMatches, 7400 SemanticMatches, 1242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135253 ImplicationChecksByTransitivity, 130.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 28049 NumberOfCodeBlocks, 28049 NumberOfCodeBlocksAsserted, 148 NumberOfCheckSat, 27901 ConstructedInterpolants, 0 QuantifiedInterpolants, 180618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 148 InterpolantComputations, 42 PerfectInterpolantSequences, 24983/31993 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: 468]: 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: (((((((a21 != 1) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) || (a7 != 1)) || ((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) || (((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) || (((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((a21 != 1) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) || (a7 != 1)) || ((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) || (((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) || (((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.74ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 63.8MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.12ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 58.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.67ms. Allocated memory is still 117.4MB. Free memory was 58.4MB in the beginning and 54.5MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1243.14ms. Allocated memory was 117.4MB in the beginning and 209.7MB in the end (delta: 92.3MB). Free memory was 54.3MB in the beginning and 113.7MB in the end (delta: -59.4MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * CodeCheck took 202602.52ms. Allocated memory was 209.7MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 113.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 767.9MB. Max. memory is 16.1GB. * Witness Printer took 111.96ms. Allocated memory is still 2.4GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 00:26:00,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df0b57a4-53e7-45c5-96e5-8f5a0385d28b/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