./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label25.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_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/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_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/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_7598dde8-18d7-4819-ae7a-1092717eda17/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 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:45:50,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:45:50,477 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:45:50,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:45:50,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:45:50,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:45:50,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:45:50,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:45:50,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:45:50,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:45:50,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:45:50,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:45:50,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:45:50,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:45:50,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:45:50,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:45:50,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:45:50,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:45:50,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:45:50,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:45:50,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:45:50,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:45:50,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:45:50,504 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:45:50,504 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:45:50,504 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:45:50,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:45:50,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:45:50,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:45:50,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:45:50,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:45:50,505 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:45:50,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:45:50,505 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_7598dde8-18d7-4819-ae7a-1092717eda17/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 -> 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8 [2024-12-06 05:45:50,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:45:50,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:45:50,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:45:50,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:45:50,715 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:45:50,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2024-12-06 05:45:53,399 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/data/a4484a1b7/d93d3ec87cbe4f56898d649c2aedd755/FLAGda10902e1 [2024-12-06 05:45:53,653 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:45:53,654 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2024-12-06 05:45:53,665 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/data/a4484a1b7/d93d3ec87cbe4f56898d649c2aedd755/FLAGda10902e1 [2024-12-06 05:45:53,973 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/data/a4484a1b7/d93d3ec87cbe4f56898d649c2aedd755 [2024-12-06 05:45:53,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:45:53,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:45:53,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:45:53,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:45:53,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:45:53,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:45:53" (1/1) ... [2024-12-06 05:45:53,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391498f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:53, skipping insertion in model container [2024-12-06 05:45:53,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:45:53" (1/1) ... [2024-12-06 05:45:54,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:45:54,234 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_7598dde8-18d7-4819-ae7a-1092717eda17/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359] [2024-12-06 05:45:54,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:45:54,262 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:45:54,326 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_7598dde8-18d7-4819-ae7a-1092717eda17/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359] [2024-12-06 05:45:54,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:45:54,347 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:45:54,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54 WrapperNode [2024-12-06 05:45:54,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:45:54,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:45:54,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:45:54,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:45:54,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,404 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 05:45:54,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:45:54,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:45:54,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:45:54,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:45:54,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:45:54,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:45:54,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:45:54,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:45:54,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:54" (1/1) ... [2024-12-06 05:45:54,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:45:54,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:45:54,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:45:54,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:45:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:45:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:45:54,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:45:54,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:45:54,560 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:45:54,562 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:45:55,394 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 05:45:55,395 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:45:55,615 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:45:55,615 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 05:45:55,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:45:55 BoogieIcfgContainer [2024-12-06 05:45:55,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:45:55,616 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:45:55,616 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:45:55,626 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:45:55,626 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:45:55" (1/1) ... [2024-12-06 05:45:55,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:45:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 05:45:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 05:45:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 05:45:55,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:56,398 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 05:45:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-12-06 05:45:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-12-06 05:45:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 05:45:57,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:45:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-12-06 05:45:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-12-06 05:45:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 05:45:57,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:58,260 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 05:45:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-12-06 05:45:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-12-06 05:45:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 05:45:58,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:58,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:59,171 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 05:45:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-12-06 05:45:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-12-06 05:45:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 05:45:59,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:59,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:45:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:45:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:45:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-12-06 05:45:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-12-06 05:45:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 05:45:59,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:45:59,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:45:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:46:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-12-06 05:46:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-12-06 05:46:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 05:46:00,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:00,296 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 05:46:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-12-06 05:46:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-12-06 05:46:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 05:46:01,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:01,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:01,281 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 05:46:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-12-06 05:46:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-12-06 05:46:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 05:46:01,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:01,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:02,024 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 05:46:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-12-06 05:46:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-12-06 05:46:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 05:46:02,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:02,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:02,871 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 05:46:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-12-06 05:46:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-12-06 05:46:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 05:46:03,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:03,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:04,217 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 05:46:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-12-06 05:46:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-12-06 05:46:04,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 05:46:04,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:04,691 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 05:46:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-12-06 05:46:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-12-06 05:46:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 05:46:06,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:06,228 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 05:46:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-12-06 05:46:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-12-06 05:46:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 05:46:06,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:06,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 05:46:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-12-06 05:46:06,827 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-12-06 05:46:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 05:46:06,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:06,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 05:46:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-12-06 05:46:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-12-06 05:46:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 05:46:07,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:07,449 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 05:46:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-12-06 05:46:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-12-06 05:46:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 05:46:08,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:08,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:08,901 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 05:46:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-12-06 05:46:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-12-06 05:46:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 05:46:09,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:09,805 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 05:46:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-12-06 05:46:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-12-06 05:46:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 05:46:10,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:46:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-12-06 05:46:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-12-06 05:46:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 05:46:10,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:46:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-12-06 05:46:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-12-06 05:46:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-06 05:46:11,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 05:46:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-12-06 05:46:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-12-06 05:46:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 05:46:11,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:11,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:11,741 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 05:46:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 658 states and 796 transitions. [2024-12-06 05:46:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 796 transitions. [2024-12-06 05:46:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 05:46:11,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:46:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 705 states and 857 transitions. [2024-12-06 05:46:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 857 transitions. [2024-12-06 05:46:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 05:46:12,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:12,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:46:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 720 states and 876 transitions. [2024-12-06 05:46:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 876 transitions. [2024-12-06 05:46:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 05:46:13,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:13,945 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 05:46:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 804 states and 974 transitions. [2024-12-06 05:46:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 974 transitions. [2024-12-06 05:46:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 05:46:16,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:16,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 856 states and 1040 transitions. [2024-12-06 05:46:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1040 transitions. [2024-12-06 05:46:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 05:46:18,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:18,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:46:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 918 states and 1113 transitions. [2024-12-06 05:46:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1113 transitions. [2024-12-06 05:46:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 05:46:20,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:20,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:46:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 920 states and 1114 transitions. [2024-12-06 05:46:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1114 transitions. [2024-12-06 05:46:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:46:20,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:21,112 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 05:46:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1013 states and 1227 transitions. [2024-12-06 05:46:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1227 transitions. [2024-12-06 05:46:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:46:23,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:23,416 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 05:46:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1017 states and 1232 transitions. [2024-12-06 05:46:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1232 transitions. [2024-12-06 05:46:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:46:23,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:23,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-06 05:46:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1039 states and 1257 transitions. [2024-12-06 05:46:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1257 transitions. [2024-12-06 05:46:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 05:46:24,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:24,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:46:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1054 states and 1276 transitions. [2024-12-06 05:46:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1276 transitions. [2024-12-06 05:46:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 05:46:25,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:25,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 05:46:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1124 states and 1348 transitions. [2024-12-06 05:46:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1348 transitions. [2024-12-06 05:46:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 05:46:27,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1187 states and 1420 transitions. [2024-12-06 05:46:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1420 transitions. [2024-12-06 05:46:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 05:46:28,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:28,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1220 states and 1458 transitions. [2024-12-06 05:46:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1458 transitions. [2024-12-06 05:46:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 05:46:29,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1221 states and 1459 transitions. [2024-12-06 05:46:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1459 transitions. [2024-12-06 05:46:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 05:46:30,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:30,714 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 05:46:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1265 states and 1516 transitions. [2024-12-06 05:46:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1516 transitions. [2024-12-06 05:46:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 05:46:31,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:31,691 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 05:46:32,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1281 states and 1532 transitions. [2024-12-06 05:46:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1532 transitions. [2024-12-06 05:46:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 05:46:32,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:32,256 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 05:46:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1319 states and 1575 transitions. [2024-12-06 05:46:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1575 transitions. [2024-12-06 05:46:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:46:33,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:33,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 05:46:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1340 states and 1603 transitions. [2024-12-06 05:46:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1603 transitions. [2024-12-06 05:46:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:46:34,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:34,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 05:46:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1374 states and 1639 transitions. [2024-12-06 05:46:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1639 transitions. [2024-12-06 05:46:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 05:46:36,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1399 states and 1669 transitions. [2024-12-06 05:46:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1669 transitions. [2024-12-06 05:46:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 05:46:38,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:46:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1416 states and 1685 transitions. [2024-12-06 05:46:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1685 transitions. [2024-12-06 05:46:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:46:40,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:40,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:40,509 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 05:46:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1461 states and 1746 transitions. [2024-12-06 05:46:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1746 transitions. [2024-12-06 05:46:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:46:42,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:42,563 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 05:46:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1473 states and 1756 transitions. [2024-12-06 05:46:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1756 transitions. [2024-12-06 05:46:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:46:43,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:43,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:43,821 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 05:46:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1489 states and 1774 transitions. [2024-12-06 05:46:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1774 transitions. [2024-12-06 05:46:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:46:44,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:44,938 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 05:46:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1492 states and 1777 transitions. [2024-12-06 05:46:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1777 transitions. [2024-12-06 05:46:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 05:46:45,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:45,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:46:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1626 states and 1928 transitions. [2024-12-06 05:46:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 1928 transitions. [2024-12-06 05:46:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:46:48,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:48,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 05:46:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1654 states and 1957 transitions. [2024-12-06 05:46:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1957 transitions. [2024-12-06 05:46:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:46:50,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:50,474 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 05:46:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1667 states and 1972 transitions. [2024-12-06 05:46:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 1972 transitions. [2024-12-06 05:46:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:46:50,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:51,259 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 05:46:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1670 states and 1976 transitions. [2024-12-06 05:46:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 1976 transitions. [2024-12-06 05:46:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 05:46:51,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:51,978 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 05:46:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1758 states and 2076 transitions. [2024-12-06 05:46:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2076 transitions. [2024-12-06 05:46:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-06 05:46:53,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:46:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 1832 states and 2152 transitions. [2024-12-06 05:46:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2152 transitions. [2024-12-06 05:46:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 05:46:55,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:55,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 05:46:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1853 states and 2174 transitions. [2024-12-06 05:46:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2174 transitions. [2024-12-06 05:46:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 05:46:57,547 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 05:46:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 1855 states and 2176 transitions. [2024-12-06 05:46:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2176 transitions. [2024-12-06 05:46:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-06 05:46:57,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:57,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-06 05:46:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:46:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 1870 states and 2193 transitions. [2024-12-06 05:46:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2193 transitions. [2024-12-06 05:46:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-12-06 05:46:58,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:46:58,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:46:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:46:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-06 05:47:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 1907 states and 2238 transitions. [2024-12-06 05:47:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2238 transitions. [2024-12-06 05:47:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-06 05:47:00,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:00,748 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 05:47:01,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 1918 states and 2250 transitions. [2024-12-06 05:47:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2250 transitions. [2024-12-06 05:47:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 05:47:01,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:01,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:47:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 1921 states and 2254 transitions. [2024-12-06 05:47:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2254 transitions. [2024-12-06 05:47:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-06 05:47:02,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:47:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 1924 states and 2257 transitions. [2024-12-06 05:47:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2257 transitions. [2024-12-06 05:47:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-06 05:47:02,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 190 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:47:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1936 states and 2271 transitions. [2024-12-06 05:47:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2271 transitions. [2024-12-06 05:47:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 05:47:04,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:04,650 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 05:47:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1950 states and 2287 transitions. [2024-12-06 05:47:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2287 transitions. [2024-12-06 05:47:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 05:47:05,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:05,532 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 05:47:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 1991 states and 2335 transitions. [2024-12-06 05:47:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2335 transitions. [2024-12-06 05:47:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 05:47:06,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:06,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:47:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2030 states and 2390 transitions. [2024-12-06 05:47:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2390 transitions. [2024-12-06 05:47:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:47:09,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:09,951 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 05:47:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2044 states and 2405 transitions. [2024-12-06 05:47:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2405 transitions. [2024-12-06 05:47:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:47:10,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-12-06 05:47:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2047 states and 2408 transitions. [2024-12-06 05:47:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2408 transitions. [2024-12-06 05:47:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-06 05:47:11,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-06 05:47:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2059 states and 2421 transitions. [2024-12-06 05:47:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2421 transitions. [2024-12-06 05:47:12,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-06 05:47:12,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:12,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-06 05:47:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2061 states and 2426 transitions. [2024-12-06 05:47:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2426 transitions. [2024-12-06 05:47:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:47:13,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:13,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-06 05:47:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2073 states and 2439 transitions. [2024-12-06 05:47:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2439 transitions. [2024-12-06 05:47:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:47:14,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:14,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:14,567 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 05:47:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2150 states and 2533 transitions. [2024-12-06 05:47:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2533 transitions. [2024-12-06 05:47:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:47:19,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:19,626 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 05:47:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2167 states and 2551 transitions. [2024-12-06 05:47:21,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 2551 transitions. [2024-12-06 05:47:21,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:47:21,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:47:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2170 states and 2554 transitions. [2024-12-06 05:47:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2554 transitions. [2024-12-06 05:47:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 05:47:21,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:21,995 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 05:47:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2179 states and 2563 transitions. [2024-12-06 05:47:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2563 transitions. [2024-12-06 05:47:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 05:47:22,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:22,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-12-06 05:47:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2203 states and 2589 transitions. [2024-12-06 05:47:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 2589 transitions. [2024-12-06 05:47:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 05:47:23,104 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:23,536 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 05:47:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2280 states and 2685 transitions. [2024-12-06 05:47:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 2685 transitions. [2024-12-06 05:47:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 05:47:27,836 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:27,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:28,188 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 05:47:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2284 states and 2689 transitions. [2024-12-06 05:47:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2689 transitions. [2024-12-06 05:47:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 05:47:28,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-12-06 05:47:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2287 states and 2692 transitions. [2024-12-06 05:47:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2692 transitions. [2024-12-06 05:47:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 05:47:29,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-12-06 05:47:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2290 states and 2695 transitions. [2024-12-06 05:47:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 2695 transitions. [2024-12-06 05:47:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 05:47:29,482 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:29,796 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 05:47:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2293 states and 2701 transitions. [2024-12-06 05:47:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 2701 transitions. [2024-12-06 05:47:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:47:30,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:47:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2304 states and 2714 transitions. [2024-12-06 05:47:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 2714 transitions. [2024-12-06 05:47:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:47:32,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:32,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:32,792 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 05:47:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2375 states and 2793 transitions. [2024-12-06 05:47:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2793 transitions. [2024-12-06 05:47:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:47:39,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:39,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:39,721 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 05:47:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2376 states and 2793 transitions. [2024-12-06 05:47:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2793 transitions. [2024-12-06 05:47:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:47:40,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:40,577 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 05:47:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2423 states and 2842 transitions. [2024-12-06 05:47:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2842 transitions. [2024-12-06 05:47:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:47:44,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:44,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:45,257 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 05:47:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2424 states and 2842 transitions. [2024-12-06 05:47:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2842 transitions. [2024-12-06 05:47:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:47:45,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:45,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 05:47:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2425 states and 2843 transitions. [2024-12-06 05:47:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 2843 transitions. [2024-12-06 05:47:46,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:47:46,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:46,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 05:47:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2426 states and 2843 transitions. [2024-12-06 05:47:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2843 transitions. [2024-12-06 05:47:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:47:47,025 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 05:47:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2427 states and 2843 transitions. [2024-12-06 05:47:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 2843 transitions. [2024-12-06 05:47:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 05:47:47,737 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:47,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:48,025 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 05:47:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2434 states and 2850 transitions. [2024-12-06 05:47:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2850 transitions. [2024-12-06 05:47:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 05:47:48,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:48,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:47:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2457 states and 2881 transitions. [2024-12-06 05:47:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 2881 transitions. [2024-12-06 05:47:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 05:47:51,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:51,322 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 05:47:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2488 states and 2914 transitions. [2024-12-06 05:47:53,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 2914 transitions. [2024-12-06 05:47:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:47:53,991 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:53,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:54,284 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 05:47:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2491 states and 2918 transitions. [2024-12-06 05:47:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 2918 transitions. [2024-12-06 05:47:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:47:54,443 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:54,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:47:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:47:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2503 states and 2933 transitions. [2024-12-06 05:47:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2933 transitions. [2024-12-06 05:47:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:47:56,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:47:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:47:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:47:56,638 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 05:48:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 2630 states and 3077 transitions. [2024-12-06 05:48:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3077 transitions. [2024-12-06 05:48:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 05:48:04,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:04,715 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 05:48:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 2691 states and 3146 transitions. [2024-12-06 05:48:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3146 transitions. [2024-12-06 05:48:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 05:48:07,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:07,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:07,576 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 05:48:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 2696 states and 3152 transitions. [2024-12-06 05:48:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3152 transitions. [2024-12-06 05:48:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 05:48:07,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:07,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-12-06 05:48:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 2697 states and 3152 transitions. [2024-12-06 05:48:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3152 transitions. [2024-12-06 05:48:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 05:48:08,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:08,809 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 05:48:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 2749 states and 3201 transitions. [2024-12-06 05:48:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3201 transitions. [2024-12-06 05:48:11,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 05:48:11,694 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 98 iterations. [2024-12-06 05:48:11,702 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 05:48:42,493 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,493 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,493 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,493 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,494 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,494 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,494 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,494 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,495 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,495 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,495 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,495 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,495 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,496 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,496 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,496 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,496 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,496 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,497 INFO L77 FloydHoareUtils]: At program point L539-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-12-06 05:48:42,497 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,497 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,497 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,498 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,498 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,498 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,498 INFO L77 FloydHoareUtils]: At program point L542-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-12-06 05:48:42,498 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,498 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,498 INFO L75 FloydHoareUtils]: For program point L543(line 543) no Hoare annotation was computed. [2024-12-06 05:48:42,498 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,499 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,499 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,499 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,499 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,499 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,499 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,499 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,500 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,500 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,500 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,500 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,500 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,500 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,501 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,501 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,501 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,501 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,501 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,501 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,501 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 05:48:42,501 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,501 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,502 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,503 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,503 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,503 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,503 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 05:48:42,503 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2024-12-06 05:48:42,503 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,503 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,503 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,503 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,503 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-12-06 05:48:42,504 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse10 (= ~a17~0 1)) (.cse11 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse12 (= 14 ~a8~0)) (.cse8 (= ~a16~0 4)) (.cse2 (not .cse11)) (.cse9 (= 5 ~a16~0)) (.cse4 (not .cse10)) (.cse3 (= ~a12~0 8)) (.cse5 (= ~a21~0 1)) (.cse7 (= ~a8~0 15)) (.cse0 (not .cse6))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~a8~0 13) (and .cse3 .cse9 .cse5 .cse10 .cse11 .cse7) (and .cse2 .cse3 .cse12 .cse4 .cse5 .cse8) (and .cse3 .cse12 .cse9 .cse4 .cse5) (and .cse0 (not .cse8)) (and .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (and .cse0 (not .cse3)) (and (not (and .cse5 .cse7 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0)))) [2024-12-06 05:48:42,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:48:42 ImpRootNode [2024-12-06 05:48:42,515 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:48:42,516 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:48:42,516 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:48:42,516 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:48:42,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:45:55" (3/4) ... [2024-12-06 05:48:42,518 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 05:48:42,530 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-12-06 05:48:42,531 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 05:48:42,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-06 05:48:42,533 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 05:48:42,627 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:48:42,627 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:48:42,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:48:42,628 INFO L158 Benchmark]: Toolchain (without parser) took 168651.90ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 91.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 357.4MB. Max. memory is 16.1GB. [2024-12-06 05:48:42,629 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:48:42,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.47ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 64.4MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 05:48:42,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.50ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 59.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:48:42,629 INFO L158 Benchmark]: Boogie Preprocessor took 52.24ms. Allocated memory is still 117.4MB. Free memory was 59.0MB in the beginning and 54.8MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:48:42,630 INFO L158 Benchmark]: RCFGBuilder took 1158.16ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 54.8MB in the beginning and 175.5MB in the end (delta: -120.7MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-12-06 05:48:42,630 INFO L158 Benchmark]: CodeCheck took 166898.87ms. Allocated memory was 218.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 175.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 329.8MB. Max. memory is 16.1GB. [2024-12-06 05:48:42,630 INFO L158 Benchmark]: Witness Printer took 111.81ms. Allocated memory is still 2.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:48:42,632 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: 136.1s, OverallIterations: 98, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 296254 SdHoareTripleChecker+Valid, 665.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295388 mSDsluCounter, 39196 SdHoareTripleChecker+Invalid, 573.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33263 mSDsCounter, 64685 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 644004 IncrementalHoareTripleChecker+Invalid, 708689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64685 mSolverCounterUnsat, 5933 mSDtfsCounter, 644004 mSolverCounterSat, 5.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132816 GetRequests, 124562 SyntacticMatches, 7296 SemanticMatches, 958 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653574 ImplicationChecksByTransitivity, 92.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 25.2s InterpolantComputationTime, 19771 NumberOfCodeBlocks, 19771 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 19674 ConstructedInterpolants, 0 QuantifiedInterpolants, 157447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 28 PerfectInterpolantSequences, 18310/23228 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: 543]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !(((((!((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((((!((((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15))) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.47ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 64.4MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.50ms. Allocated memory is still 117.4MB. Free memory was 64.4MB in the beginning and 59.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.24ms. Allocated memory is still 117.4MB. Free memory was 59.0MB in the beginning and 54.8MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1158.16ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 54.8MB in the beginning and 175.5MB in the end (delta: -120.7MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * CodeCheck took 166898.87ms. Allocated memory was 218.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 175.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 329.8MB. Max. memory is 16.1GB. * Witness Printer took 111.81ms. Allocated memory is still 2.1GB. Free memory was 1.7GB in the beginning and 1.7GB 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 05:48:42,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7598dde8-18d7-4819-ae7a-1092717eda17/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