./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label11.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_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/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_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/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_1d0fe702-5160-480c-a31c-b830d811accb/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 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 02:17:17,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 02:17:17,916 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 02:17:17,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 02:17:17,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 02:17:17,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 02:17:17,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 02:17:17,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 02:17:17,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 02:17:17,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 02:17:17,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 02:17:17,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 02:17:17,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 02:17:17,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 02:17:17,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 02:17:17,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 02:17:17,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 02:17:17,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 02:17:17,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 02:17:17,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 02:17:17,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 02:17:17,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 02:17:17,944 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 02:17:17,944 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 02:17:17,944 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 02:17:17,944 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 02:17:17,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 02:17:17,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:17:17,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 02:17:17,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 02:17:17,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 02:17:17,944 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 02:17:17,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 02:17:17,945 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_1d0fe702-5160-480c-a31c-b830d811accb/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 -> 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de [2024-12-06 02:17:18,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 02:17:18,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 02:17:18,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 02:17:18,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 02:17:18,189 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 02:17:18,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2024-12-06 02:17:20,855 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/data/043024f36/d1a48700dbcb422da01f7b38f7f8200b/FLAG23eedcee4 [2024-12-06 02:17:21,092 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 02:17:21,093 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2024-12-06 02:17:21,104 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/data/043024f36/d1a48700dbcb422da01f7b38f7f8200b/FLAG23eedcee4 [2024-12-06 02:17:21,119 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/data/043024f36/d1a48700dbcb422da01f7b38f7f8200b [2024-12-06 02:17:21,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 02:17:21,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 02:17:21,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 02:17:21,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 02:17:21,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 02:17:21,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653b6eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21, skipping insertion in model container [2024-12-06 02:17:21,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 02:17:21,409 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_1d0fe702-5160-480c-a31c-b830d811accb/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112] [2024-12-06 02:17:21,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:17:21,440 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 02:17:21,510 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_1d0fe702-5160-480c-a31c-b830d811accb/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112] [2024-12-06 02:17:21,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 02:17:21,533 INFO L204 MainTranslator]: Completed translation [2024-12-06 02:17:21,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21 WrapperNode [2024-12-06 02:17:21,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 02:17:21,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 02:17:21,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 02:17:21,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 02:17:21,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,589 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 02:17:21,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 02:17:21,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 02:17:21,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 02:17:21,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 02:17:21,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 02:17:21,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 02:17:21,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 02:17:21,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 02:17:21,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:17:21" (1/1) ... [2024-12-06 02:17:21,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 02:17:21,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 02:17:21,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 02:17:21,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 02:17:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 02:17:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 02:17:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 02:17:21,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 02:17:21,752 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 02:17:21,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 02:17:22,580 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 02:17:22,580 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 02:17:22,808 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 02:17:22,809 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 02:17:22,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:17:22 BoogieIcfgContainer [2024-12-06 02:17:22,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 02:17:22,810 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 02:17:22,810 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 02:17:22,819 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 02:17:22,819 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:17:22" (1/1) ... [2024-12-06 02:17:22,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 02:17:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 02:17:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 02:17:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 02:17:22,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:22,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:23,296 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 02:17:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-12-06 02:17:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-12-06 02:17:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 02:17:23,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:23,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-12-06 02:17:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-12-06 02:17:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 02:17:24,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:24,380 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 02:17:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-12-06 02:17:24,459 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-12-06 02:17:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 02:17:24,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 226 states and 305 transitions. [2024-12-06 02:17:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-12-06 02:17:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-06 02:17:25,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:25,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 227 states and 307 transitions. [2024-12-06 02:17:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2024-12-06 02:17:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-06 02:17:25,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 230 states and 310 transitions. [2024-12-06 02:17:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2024-12-06 02:17:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 02:17:25,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:25,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 238 states and 323 transitions. [2024-12-06 02:17:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-12-06 02:17:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 02:17:26,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:26,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 243 states and 328 transitions. [2024-12-06 02:17:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 328 transitions. [2024-12-06 02:17:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 02:17:26,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-12-06 02:17:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-12-06 02:17:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 02:17:26,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:26,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 257 states and 346 transitions. [2024-12-06 02:17:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2024-12-06 02:17:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-06 02:17:27,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:27,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 259 states and 348 transitions. [2024-12-06 02:17:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-12-06 02:17:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-06 02:17:27,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:27,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:17:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 268 states and 360 transitions. [2024-12-06 02:17:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 360 transitions. [2024-12-06 02:17:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 02:17:28,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:28,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:17:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 272 states and 365 transitions. [2024-12-06 02:17:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-12-06 02:17:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-06 02:17:28,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:28,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 275 states and 371 transitions. [2024-12-06 02:17:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2024-12-06 02:17:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-06 02:17:28,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:28,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 287 states and 387 transitions. [2024-12-06 02:17:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-12-06 02:17:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 02:17:29,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 288 states and 387 transitions. [2024-12-06 02:17:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 387 transitions. [2024-12-06 02:17:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 02:17:29,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 305 states and 406 transitions. [2024-12-06 02:17:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 406 transitions. [2024-12-06 02:17:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 02:17:29,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:29,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:17:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 320 states and 423 transitions. [2024-12-06 02:17:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2024-12-06 02:17:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 02:17:30,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 335 states and 439 transitions. [2024-12-06 02:17:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2024-12-06 02:17:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 02:17:30,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:17:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 349 states and 453 transitions. [2024-12-06 02:17:31,038 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 453 transitions. [2024-12-06 02:17:31,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 02:17:31,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:17:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 352 states and 457 transitions. [2024-12-06 02:17:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 457 transitions. [2024-12-06 02:17:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 02:17:31,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 360 states and 468 transitions. [2024-12-06 02:17:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 468 transitions. [2024-12-06 02:17:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 02:17:31,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:17:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 374 states and 482 transitions. [2024-12-06 02:17:32,198 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 482 transitions. [2024-12-06 02:17:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 02:17:32,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 382 states and 492 transitions. [2024-12-06 02:17:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 492 transitions. [2024-12-06 02:17:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 02:17:32,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:32,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 385 states and 496 transitions. [2024-12-06 02:17:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 496 transitions. [2024-12-06 02:17:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 02:17:33,090 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:33,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 387 states and 500 transitions. [2024-12-06 02:17:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 500 transitions. [2024-12-06 02:17:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 02:17:33,533 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:33,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 406 states and 521 transitions. [2024-12-06 02:17:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 521 transitions. [2024-12-06 02:17:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-06 02:17:33,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 408 states and 523 transitions. [2024-12-06 02:17:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 523 transitions. [2024-12-06 02:17:34,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-06 02:17:34,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:34,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:17:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 422 states and 537 transitions. [2024-12-06 02:17:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 537 transitions. [2024-12-06 02:17:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-06 02:17:34,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:34,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 430 states and 548 transitions. [2024-12-06 02:17:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 548 transitions. [2024-12-06 02:17:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 02:17:34,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:34,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:17:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 470 states and 590 transitions. [2024-12-06 02:17:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 590 transitions. [2024-12-06 02:17:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 02:17:35,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:17:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 475 states and 595 transitions. [2024-12-06 02:17:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 595 transitions. [2024-12-06 02:17:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 02:17:35,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 02:17:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 480 states and 601 transitions. [2024-12-06 02:17:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 601 transitions. [2024-12-06 02:17:35,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 02:17:35,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 02:17:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 483 states and 605 transitions. [2024-12-06 02:17:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 605 transitions. [2024-12-06 02:17:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 02:17:36,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:17:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 485 states and 608 transitions. [2024-12-06 02:17:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 608 transitions. [2024-12-06 02:17:36,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 02:17:36,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 02:17:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 488 states and 611 transitions. [2024-12-06 02:17:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 611 transitions. [2024-12-06 02:17:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 02:17:36,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:36,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 538 states and 666 transitions. [2024-12-06 02:17:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 666 transitions. [2024-12-06 02:17:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 02:17:37,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:37,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 540 states and 667 transitions. [2024-12-06 02:17:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 667 transitions. [2024-12-06 02:17:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 02:17:37,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 02:17:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 543 states and 670 transitions. [2024-12-06 02:17:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 670 transitions. [2024-12-06 02:17:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 02:17:37,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:38,030 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 02:17:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 563 states and 691 transitions. [2024-12-06 02:17:38,237 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 691 transitions. [2024-12-06 02:17:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 02:17:38,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:38,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:38,487 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 02:17:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 703 states and 846 transitions. [2024-12-06 02:17:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 846 transitions. [2024-12-06 02:17:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 02:17:39,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:39,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:40,172 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 02:17:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 772 states and 931 transitions. [2024-12-06 02:17:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 931 transitions. [2024-12-06 02:17:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 02:17:41,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:41,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 826 states and 992 transitions. [2024-12-06 02:17:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 992 transitions. [2024-12-06 02:17:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 02:17:43,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 843 states and 1011 transitions. [2024-12-06 02:17:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1011 transitions. [2024-12-06 02:17:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 02:17:44,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:44,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 845 states and 1012 transitions. [2024-12-06 02:17:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1012 transitions. [2024-12-06 02:17:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 02:17:44,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 858 states and 1027 transitions. [2024-12-06 02:17:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1027 transitions. [2024-12-06 02:17:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-12-06 02:17:45,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 02:17:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 872 states and 1044 transitions. [2024-12-06 02:17:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1044 transitions. [2024-12-06 02:17:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 02:17:46,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:46,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-06 02:17:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 893 states and 1063 transitions. [2024-12-06 02:17:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1063 transitions. [2024-12-06 02:17:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 02:17:46,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:46,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:17:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 923 states and 1096 transitions. [2024-12-06 02:17:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1096 transitions. [2024-12-06 02:17:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-06 02:17:47,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:47,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 02:17:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 937 states and 1108 transitions. [2024-12-06 02:17:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1108 transitions. [2024-12-06 02:17:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 02:17:48,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:48,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 967 states and 1142 transitions. [2024-12-06 02:17:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1142 transitions. [2024-12-06 02:17:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 02:17:49,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:49,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 02:17:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1013 states and 1195 transitions. [2024-12-06 02:17:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1195 transitions. [2024-12-06 02:17:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 02:17:49,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 02:17:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1014 states and 1195 transitions. [2024-12-06 02:17:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1195 transitions. [2024-12-06 02:17:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 02:17:50,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:17:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1085 states and 1282 transitions. [2024-12-06 02:17:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1282 transitions. [2024-12-06 02:17:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-12-06 02:17:52,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:52,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-12-06 02:17:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1086 states and 1282 transitions. [2024-12-06 02:17:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1282 transitions. [2024-12-06 02:17:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 02:17:52,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:52,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:17:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1179 states and 1397 transitions. [2024-12-06 02:17:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1397 transitions. [2024-12-06 02:17:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 02:17:54,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:54,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 02:17:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1181 states and 1400 transitions. [2024-12-06 02:17:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1400 transitions. [2024-12-06 02:17:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-06 02:17:55,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:55,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 02:17:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1206 states and 1427 transitions. [2024-12-06 02:17:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1427 transitions. [2024-12-06 02:17:56,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-06 02:17:56,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:56,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 02:17:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1233 states and 1457 transitions. [2024-12-06 02:17:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1457 transitions. [2024-12-06 02:17:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-06 02:17:57,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-06 02:17:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1260 states and 1487 transitions. [2024-12-06 02:17:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1487 transitions. [2024-12-06 02:17:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 02:17:58,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:17:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:17:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1289 states and 1518 transitions. [2024-12-06 02:17:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1518 transitions. [2024-12-06 02:17:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 02:17:59,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:17:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:17:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:17:59,491 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 02:18:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1305 states and 1535 transitions. [2024-12-06 02:18:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1535 transitions. [2024-12-06 02:18:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 02:18:00,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:00,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:00,492 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 02:18:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1310 states and 1539 transitions. [2024-12-06 02:18:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1539 transitions. [2024-12-06 02:18:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 02:18:00,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 02:18:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1342 states and 1572 transitions. [2024-12-06 02:18:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1572 transitions. [2024-12-06 02:18:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 02:18:03,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:18:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1356 states and 1590 transitions. [2024-12-06 02:18:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1590 transitions. [2024-12-06 02:18:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 02:18:04,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-06 02:18:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1357 states and 1591 transitions. [2024-12-06 02:18:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1591 transitions. [2024-12-06 02:18:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 02:18:04,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 02:18:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1398 states and 1634 transitions. [2024-12-06 02:18:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1634 transitions. [2024-12-06 02:18:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 02:18:06,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 02:18:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1558 states and 1818 transitions. [2024-12-06 02:18:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1818 transitions. [2024-12-06 02:18:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-06 02:18:10,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:10,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:18:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1588 states and 1863 transitions. [2024-12-06 02:18:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1863 transitions. [2024-12-06 02:18:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-06 02:18:11,999 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 02:18:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1589 states and 1863 transitions. [2024-12-06 02:18:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1863 transitions. [2024-12-06 02:18:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 02:18:12,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:12,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:13,003 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 02:18:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1654 states and 1946 transitions. [2024-12-06 02:18:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1946 transitions. [2024-12-06 02:18:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 02:18:14,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:18:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1675 states and 1969 transitions. [2024-12-06 02:18:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1969 transitions. [2024-12-06 02:18:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 02:18:15,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:15,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 02:18:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1688 states and 1984 transitions. [2024-12-06 02:18:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 1984 transitions. [2024-12-06 02:18:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 02:18:15,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:16,485 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 02:18:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1740 states and 2051 transitions. [2024-12-06 02:18:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2051 transitions. [2024-12-06 02:18:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 02:18:17,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 02:18:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 1814 states and 2132 transitions. [2024-12-06 02:18:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2132 transitions. [2024-12-06 02:18:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 02:18:20,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:20,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-06 02:18:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 1820 states and 2139 transitions. [2024-12-06 02:18:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2139 transitions. [2024-12-06 02:18:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-12-06 02:18:21,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 227 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 02:18:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 1829 states and 2152 transitions. [2024-12-06 02:18:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2152 transitions. [2024-12-06 02:18:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 02:18:21,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:21,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 02:18:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 1873 states and 2203 transitions. [2024-12-06 02:18:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2203 transitions. [2024-12-06 02:18:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 02:18:23,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:23,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 02:18:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 1874 states and 2205 transitions. [2024-12-06 02:18:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2205 transitions. [2024-12-06 02:18:23,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 02:18:23,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:23,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:24,277 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 02:18:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 1887 states and 2219 transitions. [2024-12-06 02:18:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2219 transitions. [2024-12-06 02:18:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 02:18:24,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 02:18:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 1921 states and 2255 transitions. [2024-12-06 02:18:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2255 transitions. [2024-12-06 02:18:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 02:18:26,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:26,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-06 02:18:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2012 states and 2352 transitions. [2024-12-06 02:18:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2352 transitions. [2024-12-06 02:18:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-06 02:18:28,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 145 proven. 72 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 02:18:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2029 states and 2369 transitions. [2024-12-06 02:18:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2369 transitions. [2024-12-06 02:18:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 02:18:29,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:29,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 02:18:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2042 states and 2384 transitions. [2024-12-06 02:18:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2384 transitions. [2024-12-06 02:18:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 02:18:30,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:30,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 02:18:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2059 states and 2401 transitions. [2024-12-06 02:18:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2401 transitions. [2024-12-06 02:18:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-12-06 02:18:30,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-06 02:18:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2081 states and 2423 transitions. [2024-12-06 02:18:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2423 transitions. [2024-12-06 02:18:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-06 02:18:31,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 02:18:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2110 states and 2460 transitions. [2024-12-06 02:18:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2460 transitions. [2024-12-06 02:18:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-06 02:18:32,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:32,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 02:18:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2139 states and 2495 transitions. [2024-12-06 02:18:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2495 transitions. [2024-12-06 02:18:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 02:18:37,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 02:18:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2141 states and 2505 transitions. [2024-12-06 02:18:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2505 transitions. [2024-12-06 02:18:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 02:18:38,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:38,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 02:18:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2169 states and 2534 transitions. [2024-12-06 02:18:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2534 transitions. [2024-12-06 02:18:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 02:18:39,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 02:18:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2171 states and 2551 transitions. [2024-12-06 02:18:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2551 transitions. [2024-12-06 02:18:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 02:18:40,884 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:40,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 02:18:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2199 states and 2579 transitions. [2024-12-06 02:18:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 2579 transitions. [2024-12-06 02:18:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 02:18:41,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 02:18:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2214 states and 2599 transitions. [2024-12-06 02:18:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2599 transitions. [2024-12-06 02:18:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 02:18:43,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:43,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 02:18:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2229 states and 2613 transitions. [2024-12-06 02:18:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2613 transitions. [2024-12-06 02:18:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 02:18:44,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 188 proven. 145 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 02:18:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2291 states and 2686 transitions. [2024-12-06 02:18:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2686 transitions. [2024-12-06 02:18:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-06 02:18:47,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 02:18:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2317 states and 2713 transitions. [2024-12-06 02:18:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2713 transitions. [2024-12-06 02:18:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-06 02:18:48,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:48,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-06 02:18:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2324 states and 2720 transitions. [2024-12-06 02:18:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2720 transitions. [2024-12-06 02:18:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-12-06 02:18:49,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:49,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-12-06 02:18:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2333 states and 2728 transitions. [2024-12-06 02:18:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 2728 transitions. [2024-12-06 02:18:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-06 02:18:49,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:49,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 160 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 02:18:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2441 states and 2854 transitions. [2024-12-06 02:18:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 2854 transitions. [2024-12-06 02:18:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 02:18:52,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:18:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2478 states and 2902 transitions. [2024-12-06 02:18:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 2902 transitions. [2024-12-06 02:18:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 02:18:54,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:54,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:18:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2502 states and 2931 transitions. [2024-12-06 02:18:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2931 transitions. [2024-12-06 02:18:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 02:18:56,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:56,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:18:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2527 states and 2964 transitions. [2024-12-06 02:18:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 2964 transitions. [2024-12-06 02:18:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 02:18:57,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:18:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2536 states and 2974 transitions. [2024-12-06 02:18:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 2974 transitions. [2024-12-06 02:18:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 02:18:58,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:58,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 02:18:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:18:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2537 states and 2978 transitions. [2024-12-06 02:18:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 2978 transitions. [2024-12-06 02:18:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 02:18:59,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:18:59,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:18:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:18:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 02:19:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2538 states and 2978 transitions. [2024-12-06 02:19:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 2978 transitions. [2024-12-06 02:19:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 02:19:00,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:00,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:00,729 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 02:19:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2554 states and 2999 transitions. [2024-12-06 02:19:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 2999 transitions. [2024-12-06 02:19:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 02:19:02,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:02,439 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 02:19:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2555 states and 2999 transitions. [2024-12-06 02:19:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 2999 transitions. [2024-12-06 02:19:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 02:19:02,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:02,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-06 02:19:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 2606 states and 3058 transitions. [2024-12-06 02:19:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3058 transitions. [2024-12-06 02:19:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 02:19:04,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:04,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 02:19:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 2642 states and 3096 transitions. [2024-12-06 02:19:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3096 transitions. [2024-12-06 02:19:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 02:19:07,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 02:19:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 2695 states and 3166 transitions. [2024-12-06 02:19:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3166 transitions. [2024-12-06 02:19:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 02:19:11,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 02:19:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 2696 states and 3168 transitions. [2024-12-06 02:19:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3168 transitions. [2024-12-06 02:19:11,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 02:19:11,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:11,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 02:19:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 2721 states and 3198 transitions. [2024-12-06 02:19:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3198 transitions. [2024-12-06 02:19:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 02:19:13,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:13,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 02:19:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 2737 states and 3214 transitions. [2024-12-06 02:19:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3214 transitions. [2024-12-06 02:19:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 02:19:14,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 02:19:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 2746 states and 3223 transitions. [2024-12-06 02:19:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 3223 transitions. [2024-12-06 02:19:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 02:19:15,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 02:19:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 2763 states and 3241 transitions. [2024-12-06 02:19:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3241 transitions. [2024-12-06 02:19:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 02:19:15,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 02:19:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 2764 states and 3241 transitions. [2024-12-06 02:19:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3241 transitions. [2024-12-06 02:19:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 02:19:15,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:15,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-06 02:19:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3263 states to 2782 states and 3263 transitions. [2024-12-06 02:19:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 3263 transitions. [2024-12-06 02:19:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 02:19:17,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:17,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-06 02:19:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 2796 states and 3276 transitions. [2024-12-06 02:19:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3276 transitions. [2024-12-06 02:19:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 02:19:18,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-06 02:19:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 2806 states and 3288 transitions. [2024-12-06 02:19:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3288 transitions. [2024-12-06 02:19:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 02:19:19,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:19,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:20,014 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 02:19:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 2836 states and 3324 transitions. [2024-12-06 02:19:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3324 transitions. [2024-12-06 02:19:21,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 02:19:21,790 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:21,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:22,126 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 02:19:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 2863 states and 3352 transitions. [2024-12-06 02:19:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3352 transitions. [2024-12-06 02:19:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 02:19:23,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:19:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 2895 states and 3393 transitions. [2024-12-06 02:19:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 3393 transitions. [2024-12-06 02:19:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 02:19:26,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:27,143 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 02:19:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 2953 states and 3459 transitions. [2024-12-06 02:19:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3459 transitions. [2024-12-06 02:19:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 02:19:29,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:29,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 02:19:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 2959 states and 3466 transitions. [2024-12-06 02:19:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 3466 transitions. [2024-12-06 02:19:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:29,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:29,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-06 02:19:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:30,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 2975 states and 3484 transitions. [2024-12-06 02:19:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 3484 transitions. [2024-12-06 02:19:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:30,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:30,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-06 02:19:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 2991 states and 3500 transitions. [2024-12-06 02:19:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 3500 transitions. [2024-12-06 02:19:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:31,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-06 02:19:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3011 states and 3522 transitions. [2024-12-06 02:19:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 3522 transitions. [2024-12-06 02:19:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 02:19:32,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:32,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:33,100 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 02:19:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3050 states and 3562 transitions. [2024-12-06 02:19:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 3562 transitions. [2024-12-06 02:19:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-12-06 02:19:35,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-12-06 02:19:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3066 states and 3578 transitions. [2024-12-06 02:19:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 3578 transitions. [2024-12-06 02:19:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 02:19:36,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:36,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:19:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3080 states and 3593 transitions. [2024-12-06 02:19:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 3593 transitions. [2024-12-06 02:19:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 02:19:38,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:38,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-06 02:19:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 3092 states and 3605 transitions. [2024-12-06 02:19:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 3605 transitions. [2024-12-06 02:19:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 02:19:38,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:38,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-12-06 02:19:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3106 states and 3621 transitions. [2024-12-06 02:19:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 3621 transitions. [2024-12-06 02:19:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 02:19:40,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:40,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:40,579 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 02:19:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3143 states and 3659 transitions. [2024-12-06 02:19:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 3659 transitions. [2024-12-06 02:19:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 02:19:42,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-12-06 02:19:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3163 states and 3678 transitions. [2024-12-06 02:19:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 3678 transitions. [2024-12-06 02:19:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 02:19:43,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 02:19:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3166 states and 3682 transitions. [2024-12-06 02:19:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 3682 transitions. [2024-12-06 02:19:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 02:19:44,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:44,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:44,973 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 02:19:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3296 states and 3828 transitions. [2024-12-06 02:19:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 3828 transitions. [2024-12-06 02:19:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-12-06 02:19:49,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-12-06 02:19:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3323 states and 3861 transitions. [2024-12-06 02:19:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 3861 transitions. [2024-12-06 02:19:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-12-06 02:19:51,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:51,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 02:19:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:19:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3441 states and 3992 transitions. [2024-12-06 02:19:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 3992 transitions. [2024-12-06 02:19:56,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 02:19:56,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:19:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:19:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:19:56,872 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 02:20:01,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 3491 states and 4056 transitions. [2024-12-06 02:20:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4056 transitions. [2024-12-06 02:20:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 02:20:01,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:20:01,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:20:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:20:01,882 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 02:20:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 3500 states and 4066 transitions. [2024-12-06 02:20:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4066 transitions. [2024-12-06 02:20:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 02:20:02,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:20:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:20:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:20:02,933 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 02:20:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 3509 states and 4076 transitions. [2024-12-06 02:20:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 4076 transitions. [2024-12-06 02:20:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 02:20:03,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:20:03,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:20:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:20:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 200 proven. 180 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 02:20:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4193 states to 3619 states and 4193 transitions. [2024-12-06 02:20:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3619 states and 4193 transitions. [2024-12-06 02:20:08,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-12-06 02:20:08,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:20:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:20:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:20:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 417 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 02:20:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 3667 states and 4248 transitions. [2024-12-06 02:20:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3667 states and 4248 transitions. [2024-12-06 02:20:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-06 02:20:11,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:20:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:20:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:20:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 293 proven. 142 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 02:20:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 3701 states and 4298 transitions. [2024-12-06 02:20:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 4298 transitions. [2024-12-06 02:20:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-12-06 02:20:16,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:20:16,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:20:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:20:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 368 proven. 105 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-06 02:20:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4306 states to 3706 states and 4306 transitions. [2024-12-06 02:20:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 4306 transitions. [2024-12-06 02:20:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-12-06 02:20:17,986 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:20:17,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:20:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:20:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 385 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-12-06 02:20:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4328 states to 3724 states and 4328 transitions. [2024-12-06 02:20:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 4328 transitions. [2024-12-06 02:20:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 02:20:20,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:20:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:20:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:20:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-06 02:20:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4341 states to 3733 states and 4341 transitions. [2024-12-06 02:20:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 4341 transitions. [2024-12-06 02:20:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 02:20:23,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:20:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:20:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:20:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-12-06 02:20:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 3739 states and 4346 transitions. [2024-12-06 02:20:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 4346 transitions. [2024-12-06 02:20:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 02:20:24,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 02:20:24,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 02:20:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 02:20:25,811 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 02:20:32,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 02:20:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4411 states to 3794 states and 4411 transitions. [2024-12-06 02:20:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 4411 transitions. [2024-12-06 02:20:32,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 02:20:32,509 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 150 iterations. [2024-12-06 02:20:32,516 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 02:21:10,126 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,126 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,126 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,126 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,126 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,127 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,127 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,127 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,127 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,128 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,128 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,128 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,128 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,128 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,129 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,129 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,129 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,129 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,129 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,130 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,130 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,130 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,130 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,130 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,130 INFO L77 FloydHoareUtils]: At program point L509-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-12-06 02:21:10,130 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,130 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,130 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,131 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,131 INFO L77 FloydHoareUtils]: At program point L512-1(lines 40 585) the Hoare annotation is: (not (let ((.cse1 (= 5 ~a16~0)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a20~0 ~a7~0))) (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= 14 ~a8~0) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse5 (= ~a17~0 ~a7~0)))))) [2024-12-06 02:21:10,131 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,131 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,131 INFO L75 FloydHoareUtils]: For program point L513(line 513) no Hoare annotation was computed. [2024-12-06 02:21:10,131 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,131 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,131 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,131 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,132 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,132 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,132 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,132 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,132 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,132 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,132 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,133 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,133 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,133 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,133 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,133 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,133 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 02:21:10,133 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,133 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 02:21:10,133 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,134 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,135 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,135 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,135 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,135 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,135 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 513) no Hoare annotation was computed. [2024-12-06 02:21:10,135 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,135 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,135 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,136 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,136 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-12-06 02:21:10,136 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse8 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse7 (= ~a16~0 4)) (.cse6 (not .cse8)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse2 (not (= ~a17~0 1))) (.cse3 (= ~a21~0 1)) (.cse10 (= ~a8~0 15)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not .cse0) .cse5) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse0 (not .cse4) .cse3 .cse8 .cse7) (and (<= ~a16~0 4) .cse5) (and (not .cse9) (< ~a8~0 15)) (and .cse6 .cse0 .cse9 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse5) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and (not (and .cse3 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse5)))) [2024-12-06 02:21:10,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 02:21:10 ImpRootNode [2024-12-06 02:21:10,150 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 02:21:10,151 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 02:21:10,151 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 02:21:10,151 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 02:21:10,152 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:17:22" (3/4) ... [2024-12-06 02:21:10,154 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 02:21:10,167 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-12-06 02:21:10,168 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-12-06 02:21:10,169 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-06 02:21:10,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 02:21:10,287 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 02:21:10,288 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 02:21:10,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 02:21:10,289 INFO L158 Benchmark]: Toolchain (without parser) took 229166.29ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 115.7MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 289.1MB. Max. memory is 16.1GB. [2024-12-06 02:21:10,289 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:21:10,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.66ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 88.9MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 02:21:10,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.43ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 83.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:21:10,290 INFO L158 Benchmark]: Boogie Preprocessor took 40.24ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 79.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 02:21:10,290 INFO L158 Benchmark]: RCFGBuilder took 1178.56ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 65.1MB in the end (delta: 14.1MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2024-12-06 02:21:10,291 INFO L158 Benchmark]: CodeCheck took 227340.52ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 65.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 228.8MB. Max. memory is 16.1GB. [2024-12-06 02:21:10,291 INFO L158 Benchmark]: Witness Printer took 137.07ms. Allocated memory is still 2.3GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 02:21:10,293 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: 189.7s, OverallIterations: 150, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 537198 SdHoareTripleChecker+Valid, 1138.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 534811 mSDsluCounter, 71623 SdHoareTripleChecker+Invalid, 974.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61098 mSDsCounter, 93586 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1127145 IncrementalHoareTripleChecker+Invalid, 1220731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93586 mSolverCounterUnsat, 10525 mSDtfsCounter, 1127145 mSolverCounterSat, 7.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191719 GetRequests, 183038 SyntacticMatches, 7329 SemanticMatches, 1352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212638 ImplicationChecksByTransitivity, 134.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 28667 NumberOfCodeBlocks, 28667 NumberOfCodeBlocksAsserted, 149 NumberOfCheckSat, 28518 ConstructedInterpolants, 0 QuantifiedInterpolants, 149727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 149 InterpolantComputations, 75 PerfectInterpolantSequences, 28190/33633 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: 513]: 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: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && (14 == a8)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.66ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 88.9MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.43ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 83.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.24ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 79.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1178.56ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 65.1MB in the end (delta: 14.1MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * CodeCheck took 227340.52ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 65.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 228.8MB. Max. memory is 16.1GB. * Witness Printer took 137.07ms. Allocated memory is still 2.3GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 02:21:10,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d0fe702-5160-480c-a31c-b830d811accb/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