./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9 --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 963f44e67d66478e2f09b1d76f69d50cb14e9cad52cbcb2ea23267dbf5fe671d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 23:32:02,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 23:32:02,524 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 23:32:02,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 23:32:02,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 23:32:02,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 23:32:02,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 23:32:02,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 23:32:02,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 23:32:02,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 23:32:02,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 23:32:02,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 23:32:02,556 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 23:32:02,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 23:32:02,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 23:32:02,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 23:32:02,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 23:32:02,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 23:32:02,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 23:32:02,559 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 23:32:02,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 23:32:02,560 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 23:32:02,561 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 23:32:02,561 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 23:32:02,562 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 23:32:02,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 23:32:02,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 23:32:02,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 23:32:02,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 23:32:02,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 23:32:02,565 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 23:32:02,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 23:32:02,566 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 23:32:02,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9 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 -> 963f44e67d66478e2f09b1d76f69d50cb14e9cad52cbcb2ea23267dbf5fe671d [2023-12-02 23:32:02,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 23:32:02,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 23:32:02,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 23:32:02,809 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 23:32:02,809 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 23:32:02,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c [2023-12-02 23:32:05,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 23:32:05,872 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 23:32:05,873 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/sv-benchmarks/c/eca-rers2012/Problem01_label47.c [2023-12-02 23:32:05,887 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/data/d1a45a03d/8df4c9e4c8a34fdfadfebf8b07165890/FLAG5d75fdf2f [2023-12-02 23:32:05,900 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/data/d1a45a03d/8df4c9e4c8a34fdfadfebf8b07165890 [2023-12-02 23:32:05,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 23:32:05,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 23:32:05,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 23:32:05,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 23:32:05,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 23:32:05,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:32:05" (1/1) ... [2023-12-02 23:32:05,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4965188e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:05, skipping insertion in model container [2023-12-02 23:32:05,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:32:05" (1/1) ... [2023-12-02 23:32:05,959 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 23:32:06,207 WARN L240 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_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/sv-benchmarks/c/eca-rers2012/Problem01_label47.c[14627,14640] [2023-12-02 23:32:06,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 23:32:06,271 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 23:32:06,372 WARN L240 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_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/sv-benchmarks/c/eca-rers2012/Problem01_label47.c[14627,14640] [2023-12-02 23:32:06,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 23:32:06,416 INFO L206 MainTranslator]: Completed translation [2023-12-02 23:32:06,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06 WrapperNode [2023-12-02 23:32:06,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 23:32:06,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 23:32:06,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 23:32:06,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 23:32:06,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,491 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2023-12-02 23:32:06,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 23:32:06,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 23:32:06,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 23:32:06,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 23:32:06,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 23:32:06,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 23:32:06,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 23:32:06,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 23:32:06,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:32:06" (1/1) ... [2023-12-02 23:32:06,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 23:32:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 23:32:06,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-02 23:32:06,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-02 23:32:06,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 23:32:06,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 23:32:06,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 23:32:06,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 23:32:06,770 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 23:32:06,773 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 23:32:07,678 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 23:32:07,858 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 23:32:07,858 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 23:32:07,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:32:07 BoogieIcfgContainer [2023-12-02 23:32:07,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 23:32:07,861 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 23:32:07,861 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 23:32:07,870 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 23:32:07,870 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:32:07" (1/1) ... [2023-12-02 23:32:07,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 23:32:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2023-12-02 23:32:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2023-12-02 23:32:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 23:32:07,932 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2023-12-02 23:32:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2023-12-02 23:32:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 23:32:08,841 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:08,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 218 states and 317 transitions. [2023-12-02 23:32:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 317 transitions. [2023-12-02 23:32:09,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-02 23:32:09,808 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 223 states and 324 transitions. [2023-12-02 23:32:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2023-12-02 23:32:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-02 23:32:10,039 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 293 states and 397 transitions. [2023-12-02 23:32:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 397 transitions. [2023-12-02 23:32:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-02 23:32:10,823 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 300 states and 407 transitions. [2023-12-02 23:32:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 407 transitions. [2023-12-02 23:32:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-02 23:32:11,253 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:11,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 23:32:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 311 states and 428 transitions. [2023-12-02 23:32:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 428 transitions. [2023-12-02 23:32:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-02 23:32:11,923 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:11,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 23:32:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 314 states and 431 transitions. [2023-12-02 23:32:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 431 transitions. [2023-12-02 23:32:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-02 23:32:12,126 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:12,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:12,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 323 states and 440 transitions. [2023-12-02 23:32:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 440 transitions. [2023-12-02 23:32:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 23:32:12,512 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:12,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:32:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 331 states and 451 transitions. [2023-12-02 23:32:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 451 transitions. [2023-12-02 23:32:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 23:32:13,035 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:13,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:32:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 334 states and 455 transitions. [2023-12-02 23:32:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 455 transitions. [2023-12-02 23:32:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 23:32:13,289 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 341 states and 463 transitions. [2023-12-02 23:32:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 463 transitions. [2023-12-02 23:32:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 23:32:13,726 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:13,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 342 states and 464 transitions. [2023-12-02 23:32:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 464 transitions. [2023-12-02 23:32:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 23:32:14,209 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 344 states and 467 transitions. [2023-12-02 23:32:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 467 transitions. [2023-12-02 23:32:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 23:32:14,515 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:32:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 357 states and 482 transitions. [2023-12-02 23:32:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 482 transitions. [2023-12-02 23:32:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-02 23:32:15,063 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 366 states and 495 transitions. [2023-12-02 23:32:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 495 transitions. [2023-12-02 23:32:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-02 23:32:15,554 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 369 states and 502 transitions. [2023-12-02 23:32:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 502 transitions. [2023-12-02 23:32:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-02 23:32:15,830 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:15,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 370 states and 503 transitions. [2023-12-02 23:32:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 503 transitions. [2023-12-02 23:32:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-02 23:32:16,076 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:16,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 385 states and 525 transitions. [2023-12-02 23:32:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 525 transitions. [2023-12-02 23:32:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-02 23:32:16,982 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:16,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 400 states and 546 transitions. [2023-12-02 23:32:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 546 transitions. [2023-12-02 23:32:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 23:32:17,510 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 401 states and 549 transitions. [2023-12-02 23:32:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 549 transitions. [2023-12-02 23:32:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 23:32:17,814 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 404 states and 552 transitions. [2023-12-02 23:32:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 552 transitions. [2023-12-02 23:32:18,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-02 23:32:18,210 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 409 states and 558 transitions. [2023-12-02 23:32:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 558 transitions. [2023-12-02 23:32:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-02 23:32:18,430 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:18,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 425 states and 584 transitions. [2023-12-02 23:32:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 584 transitions. [2023-12-02 23:32:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-02 23:32:19,304 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:19,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 429 states and 588 transitions. [2023-12-02 23:32:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 588 transitions. [2023-12-02 23:32:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 23:32:19,667 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 446 states and 609 transitions. [2023-12-02 23:32:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 609 transitions. [2023-12-02 23:32:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-02 23:32:20,102 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 23:32:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 464 states and 631 transitions. [2023-12-02 23:32:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 631 transitions. [2023-12-02 23:32:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-02 23:32:20,956 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 23:32:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 467 states and 634 transitions. [2023-12-02 23:32:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 634 transitions. [2023-12-02 23:32:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-02 23:32:21,290 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:21,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 471 states and 638 transitions. [2023-12-02 23:32:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 638 transitions. [2023-12-02 23:32:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 23:32:21,425 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 488 states and 659 transitions. [2023-12-02 23:32:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 659 transitions. [2023-12-02 23:32:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 23:32:22,078 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:22,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 492 states and 663 transitions. [2023-12-02 23:32:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 663 transitions. [2023-12-02 23:32:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 23:32:22,456 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 23:32:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 500 states and 672 transitions. [2023-12-02 23:32:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 672 transitions. [2023-12-02 23:32:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 23:32:22,658 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:22,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 588 states and 772 transitions. [2023-12-02 23:32:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 772 transitions. [2023-12-02 23:32:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-02 23:32:23,570 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 591 states and 775 transitions. [2023-12-02 23:32:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 775 transitions. [2023-12-02 23:32:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-02 23:32:23,668 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:23,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 612 states and 799 transitions. [2023-12-02 23:32:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 799 transitions. [2023-12-02 23:32:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 23:32:24,167 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 23:32:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 637 states and 827 transitions. [2023-12-02 23:32:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 827 transitions. [2023-12-02 23:32:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-02 23:32:24,833 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:24,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:32:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 656 states and 846 transitions. [2023-12-02 23:32:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 846 transitions. [2023-12-02 23:32:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-02 23:32:24,993 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 23:32:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 663 states and 855 transitions. [2023-12-02 23:32:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 855 transitions. [2023-12-02 23:32:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-02 23:32:25,436 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:25,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 23:32:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 667 states and 858 transitions. [2023-12-02 23:32:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 858 transitions. [2023-12-02 23:32:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-02 23:32:25,654 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:25,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 671 states and 865 transitions. [2023-12-02 23:32:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 865 transitions. [2023-12-02 23:32:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 23:32:26,065 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:26,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 23:32:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 688 states and 885 transitions. [2023-12-02 23:32:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 885 transitions. [2023-12-02 23:32:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 23:32:26,904 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:26,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 23:32:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 702 states and 901 transitions. [2023-12-02 23:32:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 901 transitions. [2023-12-02 23:32:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 23:32:27,664 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 23:32:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 707 states and 905 transitions. [2023-12-02 23:32:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 905 transitions. [2023-12-02 23:32:27,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 23:32:27,986 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 727 states and 930 transitions. [2023-12-02 23:32:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 930 transitions. [2023-12-02 23:32:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-02 23:32:28,725 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:28,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 736 states and 943 transitions. [2023-12-02 23:32:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 943 transitions. [2023-12-02 23:32:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-02 23:32:29,205 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:29,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 739 states and 947 transitions. [2023-12-02 23:32:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2023-12-02 23:32:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-02 23:32:29,825 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 755 states and 967 transitions. [2023-12-02 23:32:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 967 transitions. [2023-12-02 23:32:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-02 23:32:30,383 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 23:32:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 774 states and 989 transitions. [2023-12-02 23:32:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 989 transitions. [2023-12-02 23:32:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-02 23:32:31,107 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 23:32:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 779 states and 993 transitions. [2023-12-02 23:32:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 993 transitions. [2023-12-02 23:32:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-02 23:32:31,350 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 824 states and 1056 transitions. [2023-12-02 23:32:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1056 transitions. [2023-12-02 23:32:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-02 23:32:34,031 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 839 states and 1069 transitions. [2023-12-02 23:32:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1069 transitions. [2023-12-02 23:32:34,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-02 23:32:34,869 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 23:32:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 845 states and 1076 transitions. [2023-12-02 23:32:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1076 transitions. [2023-12-02 23:32:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-02 23:32:35,391 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:35,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 62 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 890 states and 1142 transitions. [2023-12-02 23:32:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1142 transitions. [2023-12-02 23:32:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-02 23:32:37,803 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:37,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 62 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 911 states and 1164 transitions. [2023-12-02 23:32:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1164 transitions. [2023-12-02 23:32:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-02 23:32:39,125 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:39,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 922 states and 1178 transitions. [2023-12-02 23:32:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1178 transitions. [2023-12-02 23:32:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-02 23:32:39,908 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 926 states and 1182 transitions. [2023-12-02 23:32:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1182 transitions. [2023-12-02 23:32:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-02 23:32:40,321 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:40,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 954 states and 1230 transitions. [2023-12-02 23:32:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1230 transitions. [2023-12-02 23:32:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-02 23:32:40,565 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:40,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 957 states and 1236 transitions. [2023-12-02 23:32:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1236 transitions. [2023-12-02 23:32:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-02 23:32:41,308 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:41,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 23:32:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 972 states and 1258 transitions. [2023-12-02 23:32:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1258 transitions. [2023-12-02 23:32:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-02 23:32:42,746 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:42,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 23:32:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 975 states and 1261 transitions. [2023-12-02 23:32:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1261 transitions. [2023-12-02 23:32:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-02 23:32:43,134 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1115 states and 1412 transitions. [2023-12-02 23:32:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1412 transitions. [2023-12-02 23:32:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-02 23:32:47,163 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 23:32:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1128 states and 1426 transitions. [2023-12-02 23:32:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1426 transitions. [2023-12-02 23:32:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-02 23:32:47,469 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 23:32:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1131 states and 1428 transitions. [2023-12-02 23:32:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1428 transitions. [2023-12-02 23:32:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-02 23:32:47,690 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:47,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 23:32:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1144 states and 1449 transitions. [2023-12-02 23:32:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1449 transitions. [2023-12-02 23:32:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-02 23:32:48,300 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 23:32:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1148 states and 1452 transitions. [2023-12-02 23:32:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1452 transitions. [2023-12-02 23:32:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 23:32:48,523 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:48,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:32:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1163 states and 1469 transitions. [2023-12-02 23:32:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1469 transitions. [2023-12-02 23:32:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 23:32:49,343 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-02 23:32:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1164 states and 1470 transitions. [2023-12-02 23:32:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1470 transitions. [2023-12-02 23:32:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 23:32:49,449 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 23:32:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1187 states and 1494 transitions. [2023-12-02 23:32:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1494 transitions. [2023-12-02 23:32:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 23:32:50,374 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:50,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 23:32:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1194 states and 1500 transitions. [2023-12-02 23:32:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1500 transitions. [2023-12-02 23:32:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-02 23:32:50,683 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 23:32:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1215 states and 1521 transitions. [2023-12-02 23:32:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1521 transitions. [2023-12-02 23:32:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-02 23:32:50,881 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:50,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 23:32:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1223 states and 1531 transitions. [2023-12-02 23:32:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1531 transitions. [2023-12-02 23:32:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-02 23:32:51,643 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:51,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 23:32:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1241 states and 1552 transitions. [2023-12-02 23:32:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1552 transitions. [2023-12-02 23:32:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-02 23:32:52,207 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:52,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 23:32:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1244 states and 1555 transitions. [2023-12-02 23:32:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1555 transitions. [2023-12-02 23:32:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-02 23:32:52,575 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:52,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1257 states and 1568 transitions. [2023-12-02 23:32:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1568 transitions. [2023-12-02 23:32:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-02 23:32:53,255 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1270 states and 1582 transitions. [2023-12-02 23:32:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1582 transitions. [2023-12-02 23:32:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-02 23:32:53,825 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:53,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:32:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1341 states and 1653 transitions. [2023-12-02 23:32:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1653 transitions. [2023-12-02 23:32:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-02 23:32:55,457 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 23:32:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1342 states and 1655 transitions. [2023-12-02 23:32:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1655 transitions. [2023-12-02 23:32:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-02 23:32:55,958 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:55,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 23:32:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1353 states and 1670 transitions. [2023-12-02 23:32:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1670 transitions. [2023-12-02 23:32:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-02 23:32:57,050 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:57,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 23:32:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1356 states and 1673 transitions. [2023-12-02 23:32:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1673 transitions. [2023-12-02 23:32:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-02 23:32:57,570 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 23:32:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1381 states and 1703 transitions. [2023-12-02 23:32:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1703 transitions. [2023-12-02 23:32:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-02 23:32:58,236 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 23:32:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1401 states and 1723 transitions. [2023-12-02 23:32:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1723 transitions. [2023-12-02 23:32:58,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-02 23:32:58,846 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 101 proven. 12 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-02 23:32:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1403 states and 1725 transitions. [2023-12-02 23:32:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1725 transitions. [2023-12-02 23:32:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-02 23:32:59,289 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-02 23:32:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1416 states and 1739 transitions. [2023-12-02 23:32:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1739 transitions. [2023-12-02 23:32:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-02 23:32:59,595 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-02 23:32:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:32:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1417 states and 1740 transitions. [2023-12-02 23:32:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1740 transitions. [2023-12-02 23:32:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-02 23:32:59,701 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:32:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:32:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:32:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-02 23:33:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1439 states and 1774 transitions. [2023-12-02 23:33:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1774 transitions. [2023-12-02 23:33:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-02 23:33:02,271 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 102 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 23:33:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1441 states and 1775 transitions. [2023-12-02 23:33:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1775 transitions. [2023-12-02 23:33:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-02 23:33:02,632 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-02 23:33:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1444 states and 1778 transitions. [2023-12-02 23:33:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1778 transitions. [2023-12-02 23:33:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-02 23:33:03,093 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 23:33:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1445 states and 1781 transitions. [2023-12-02 23:33:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1781 transitions. [2023-12-02 23:33:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-02 23:33:03,525 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 23:33:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1452 states and 1788 transitions. [2023-12-02 23:33:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1788 transitions. [2023-12-02 23:33:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-02 23:33:03,851 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:03,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 23:33:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1463 states and 1801 transitions. [2023-12-02 23:33:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1801 transitions. [2023-12-02 23:33:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-02 23:33:04,358 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:04,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 23:33:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1472 states and 1812 transitions. [2023-12-02 23:33:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1812 transitions. [2023-12-02 23:33:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-02 23:33:05,137 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 23:33:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1480 states and 1821 transitions. [2023-12-02 23:33:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1821 transitions. [2023-12-02 23:33:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-02 23:33:05,576 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 23:33:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1505 states and 1848 transitions. [2023-12-02 23:33:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1848 transitions. [2023-12-02 23:33:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-02 23:33:06,295 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 23:33:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1525 states and 1868 transitions. [2023-12-02 23:33:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1868 transitions. [2023-12-02 23:33:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-02 23:33:06,726 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 99 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1558 states and 1921 transitions. [2023-12-02 23:33:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1921 transitions. [2023-12-02 23:33:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-02 23:33:10,171 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:10,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 99 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1580 states and 1951 transitions. [2023-12-02 23:33:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1951 transitions. [2023-12-02 23:33:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-02 23:33:12,250 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 99 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1588 states and 1959 transitions. [2023-12-02 23:33:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1959 transitions. [2023-12-02 23:33:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-02 23:33:12,878 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:12,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 99 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1601 states and 1977 transitions. [2023-12-02 23:33:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 1977 transitions. [2023-12-02 23:33:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-02 23:33:14,264 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 122 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-02 23:33:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1603 states and 1979 transitions. [2023-12-02 23:33:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 1979 transitions. [2023-12-02 23:33:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-02 23:33:14,937 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 103 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1614 states and 1992 transitions. [2023-12-02 23:33:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1992 transitions. [2023-12-02 23:33:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-02 23:33:15,877 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 103 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 1628 states and 2008 transitions. [2023-12-02 23:33:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2008 transitions. [2023-12-02 23:33:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-02 23:33:16,873 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-02 23:33:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1639 states and 2023 transitions. [2023-12-02 23:33:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2023 transitions. [2023-12-02 23:33:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-02 23:33:18,369 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:18,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-02 23:33:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 1640 states and 2024 transitions. [2023-12-02 23:33:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2024 transitions. [2023-12-02 23:33:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-02 23:33:18,726 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:18,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 23:33:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 1645 states and 2031 transitions. [2023-12-02 23:33:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2031 transitions. [2023-12-02 23:33:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-02 23:33:19,597 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:19,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 23:33:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1665 states and 2051 transitions. [2023-12-02 23:33:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2051 transitions. [2023-12-02 23:33:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-02 23:33:20,042 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-02 23:33:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 1674 states and 2062 transitions. [2023-12-02 23:33:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2062 transitions. [2023-12-02 23:33:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-02 23:33:20,823 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:20,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-02 23:33:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 1677 states and 2063 transitions. [2023-12-02 23:33:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2063 transitions. [2023-12-02 23:33:21,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-02 23:33:21,515 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 23:33:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1681 states and 2069 transitions. [2023-12-02 23:33:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2069 transitions. [2023-12-02 23:33:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:33:22,467 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:22,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 162 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 1728 states and 2119 transitions. [2023-12-02 23:33:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2119 transitions. [2023-12-02 23:33:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:33:24,015 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:24,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 162 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 1741 states and 2137 transitions. [2023-12-02 23:33:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2137 transitions. [2023-12-02 23:33:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:33:25,796 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 162 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1765 states and 2166 transitions. [2023-12-02 23:33:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2166 transitions. [2023-12-02 23:33:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:33:28,025 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 162 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 1773 states and 2173 transitions. [2023-12-02 23:33:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2173 transitions. [2023-12-02 23:33:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:33:28,811 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 162 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 1789 states and 2192 transitions. [2023-12-02 23:33:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2192 transitions. [2023-12-02 23:33:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:33:30,650 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 162 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 1797 states and 2199 transitions. [2023-12-02 23:33:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2199 transitions. [2023-12-02 23:33:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:33:31,420 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 162 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 1807 states and 2210 transitions. [2023-12-02 23:33:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2210 transitions. [2023-12-02 23:33:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:33:32,259 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:32,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 1836 states and 2250 transitions. [2023-12-02 23:33:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2250 transitions. [2023-12-02 23:33:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:33:35,604 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:35,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1852 states and 2271 transitions. [2023-12-02 23:33:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2271 transitions. [2023-12-02 23:33:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:33:37,551 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 23:33:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 1854 states and 2272 transitions. [2023-12-02 23:33:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2272 transitions. [2023-12-02 23:33:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-02 23:33:37,843 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:37,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 23:33:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 1859 states and 2284 transitions. [2023-12-02 23:33:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2284 transitions. [2023-12-02 23:33:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-02 23:33:39,091 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:39,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 23:33:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 1860 states and 2286 transitions. [2023-12-02 23:33:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2286 transitions. [2023-12-02 23:33:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-02 23:33:39,664 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 23:33:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1861 states and 2287 transitions. [2023-12-02 23:33:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2287 transitions. [2023-12-02 23:33:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-02 23:33:40,167 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 1911 states and 2366 transitions. [2023-12-02 23:33:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2366 transitions. [2023-12-02 23:33:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-02 23:33:46,002 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:46,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:33:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 1937 states and 2393 transitions. [2023-12-02 23:33:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2393 transitions. [2023-12-02 23:33:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-02 23:33:47,927 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:47,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 23:33:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 1949 states and 2406 transitions. [2023-12-02 23:33:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2406 transitions. [2023-12-02 23:33:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-02 23:33:49,293 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 23:33:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 1980 states and 2441 transitions. [2023-12-02 23:33:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2441 transitions. [2023-12-02 23:33:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-02 23:33:51,296 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:51,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 23:33:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2000 states and 2460 transitions. [2023-12-02 23:33:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2460 transitions. [2023-12-02 23:33:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-02 23:33:52,180 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-02 23:33:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2008 states and 2475 transitions. [2023-12-02 23:33:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2475 transitions. [2023-12-02 23:33:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-02 23:33:53,902 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:53,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-02 23:33:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2011 states and 2478 transitions. [2023-12-02 23:33:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2478 transitions. [2023-12-02 23:33:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-02 23:33:54,556 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 23:33:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2030 states and 2505 transitions. [2023-12-02 23:33:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2505 transitions. [2023-12-02 23:33:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-02 23:33:57,203 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:57,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 23:33:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2031 states and 2506 transitions. [2023-12-02 23:33:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2506 transitions. [2023-12-02 23:33:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-02 23:33:57,748 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-02 23:33:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2050 states and 2528 transitions. [2023-12-02 23:33:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2528 transitions. [2023-12-02 23:33:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-12-02 23:33:59,116 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:59,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:33:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:33:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2052 states and 2530 transitions. [2023-12-02 23:33:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2530 transitions. [2023-12-02 23:33:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-12-02 23:33:59,731 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:33:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:33:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:33:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:34:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2056 states and 2534 transitions. [2023-12-02 23:34:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2534 transitions. [2023-12-02 23:34:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-12-02 23:34:00,344 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:00,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 23:34:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2076 states and 2555 transitions. [2023-12-02 23:34:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2555 transitions. [2023-12-02 23:34:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-12-02 23:34:01,822 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 23:34:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2085 states and 2563 transitions. [2023-12-02 23:34:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2563 transitions. [2023-12-02 23:34:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-02 23:34:03,191 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:03,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-02 23:34:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2108 states and 2589 transitions. [2023-12-02 23:34:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2589 transitions. [2023-12-02 23:34:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-02 23:34:04,132 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-02 23:34:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2116 states and 2596 transitions. [2023-12-02 23:34:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2596 transitions. [2023-12-02 23:34:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-02 23:34:05,063 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:05,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-02 23:34:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2124 states and 2604 transitions. [2023-12-02 23:34:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2604 transitions. [2023-12-02 23:34:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-02 23:34:05,634 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 132 proven. 49 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:34:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2192 states and 2692 transitions. [2023-12-02 23:34:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2692 transitions. [2023-12-02 23:34:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-02 23:34:12,324 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 132 proven. 49 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 23:34:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2203 states and 2704 transitions. [2023-12-02 23:34:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 2704 transitions. [2023-12-02 23:34:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-02 23:34:14,718 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 23:34:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2273 states and 2776 transitions. [2023-12-02 23:34:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2776 transitions. [2023-12-02 23:34:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-12-02 23:34:15,649 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 23:34:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2277 states and 2779 transitions. [2023-12-02 23:34:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2779 transitions. [2023-12-02 23:34:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-12-02 23:34:16,464 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 23:34:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2285 states and 2786 transitions. [2023-12-02 23:34:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2786 transitions. [2023-12-02 23:34:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-12-02 23:34:17,253 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:17,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 23:34:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2306 states and 2807 transitions. [2023-12-02 23:34:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2807 transitions. [2023-12-02 23:34:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-12-02 23:34:18,297 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 23:34:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2314 states and 2814 transitions. [2023-12-02 23:34:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 2814 transitions. [2023-12-02 23:34:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-02 23:34:19,161 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:19,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 190 proven. 58 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-02 23:34:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2343 states and 2857 transitions. [2023-12-02 23:34:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 2857 transitions. [2023-12-02 23:34:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-02 23:34:24,243 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:24,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 184 proven. 49 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:34:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2360 states and 2883 transitions. [2023-12-02 23:34:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2883 transitions. [2023-12-02 23:34:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-02 23:34:27,722 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 184 proven. 49 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:34:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2371 states and 2896 transitions. [2023-12-02 23:34:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2896 transitions. [2023-12-02 23:34:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-02 23:34:30,048 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 23:34:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2372 states and 2899 transitions. [2023-12-02 23:34:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 2899 transitions. [2023-12-02 23:34:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-02 23:34:31,115 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:31,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-02 23:34:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2388 states and 2921 transitions. [2023-12-02 23:34:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 2921 transitions. [2023-12-02 23:34:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-02 23:34:34,781 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-02 23:34:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2396 states and 2929 transitions. [2023-12-02 23:34:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 2929 transitions. [2023-12-02 23:34:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-02 23:34:36,669 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-02 23:34:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2403 states and 2936 transitions. [2023-12-02 23:34:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2936 transitions. [2023-12-02 23:34:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-02 23:34:37,521 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:37,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:34:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2409 states and 2943 transitions. [2023-12-02 23:34:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 2943 transitions. [2023-12-02 23:34:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-02 23:34:38,162 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:34:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2412 states and 2946 transitions. [2023-12-02 23:34:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2946 transitions. [2023-12-02 23:34:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-02 23:34:38,834 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:38,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:34:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2423 states and 2958 transitions. [2023-12-02 23:34:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2958 transitions. [2023-12-02 23:34:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-02 23:34:40,176 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:40,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:34:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2443 states and 2979 transitions. [2023-12-02 23:34:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 2979 transitions. [2023-12-02 23:34:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-02 23:34:41,127 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2023-12-02 23:34:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2456 states and 2992 transitions. [2023-12-02 23:34:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 2992 transitions. [2023-12-02 23:34:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-02 23:34:41,657 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-02 23:34:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 2472 states and 3015 transitions. [2023-12-02 23:34:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3015 transitions. [2023-12-02 23:34:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-02 23:34:45,515 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-02 23:34:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 2477 states and 3018 transitions. [2023-12-02 23:34:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3018 transitions. [2023-12-02 23:34:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-02 23:34:46,340 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:46,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-02 23:34:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 2480 states and 3020 transitions. [2023-12-02 23:34:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3020 transitions. [2023-12-02 23:34:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-02 23:34:47,354 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-12-02 23:34:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 2484 states and 3023 transitions. [2023-12-02 23:34:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3023 transitions. [2023-12-02 23:34:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-02 23:34:47,843 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-12-02 23:34:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 2493 states and 3033 transitions. [2023-12-02 23:34:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3033 transitions. [2023-12-02 23:34:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-02 23:34:49,220 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:49,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-12-02 23:34:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 2494 states and 3034 transitions. [2023-12-02 23:34:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 3034 transitions. [2023-12-02 23:34:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-02 23:34:49,947 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-12-02 23:34:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 2498 states and 3038 transitions. [2023-12-02 23:34:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3038 transitions. [2023-12-02 23:34:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-02 23:34:50,654 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:50,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-12-02 23:34:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 2505 states and 3045 transitions. [2023-12-02 23:34:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3045 transitions. [2023-12-02 23:34:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-02 23:34:51,393 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 215 proven. 58 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-02 23:34:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 2537 states and 3084 transitions. [2023-12-02 23:34:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3084 transitions. [2023-12-02 23:34:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-02 23:34:56,199 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 215 proven. 58 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-02 23:34:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:34:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 2541 states and 3088 transitions. [2023-12-02 23:34:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 3088 transitions. [2023-12-02 23:34:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-02 23:34:57,351 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:34:57,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:34:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:34:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 204 proven. 49 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:35:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 2591 states and 3146 transitions. [2023-12-02 23:35:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3146 transitions. [2023-12-02 23:35:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-02 23:35:04,780 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 204 proven. 49 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:35:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 2604 states and 3157 transitions. [2023-12-02 23:35:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 3157 transitions. [2023-12-02 23:35:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-02 23:35:08,645 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:08,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 278 proven. 23 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-02 23:35:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 2652 states and 3217 transitions. [2023-12-02 23:35:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3217 transitions. [2023-12-02 23:35:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-02 23:35:11,748 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 201 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:35:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 2676 states and 3266 transitions. [2023-12-02 23:35:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3266 transitions. [2023-12-02 23:35:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-02 23:35:14,668 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 201 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:35:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 2685 states and 3274 transitions. [2023-12-02 23:35:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3274 transitions. [2023-12-02 23:35:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-02 23:35:16,619 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:16,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 201 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:35:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 2694 states and 3282 transitions. [2023-12-02 23:35:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 3282 transitions. [2023-12-02 23:35:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-02 23:35:17,169 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 201 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:35:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 2706 states and 3294 transitions. [2023-12-02 23:35:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3294 transitions. [2023-12-02 23:35:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-02 23:35:18,602 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 201 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:35:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 2713 states and 3300 transitions. [2023-12-02 23:35:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3300 transitions. [2023-12-02 23:35:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-02 23:35:19,552 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 201 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:35:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 2724 states and 3310 transitions. [2023-12-02 23:35:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3310 transitions. [2023-12-02 23:35:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-02 23:35:20,542 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 230 proven. 71 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-02 23:35:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 2727 states and 3312 transitions. [2023-12-02 23:35:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 3312 transitions. [2023-12-02 23:35:21,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-02 23:35:21,927 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-02 23:35:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 2730 states and 3317 transitions. [2023-12-02 23:35:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 3317 transitions. [2023-12-02 23:35:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-02 23:35:23,634 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-02 23:35:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 2744 states and 3330 transitions. [2023-12-02 23:35:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3330 transitions. [2023-12-02 23:35:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-02 23:35:24,762 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:24,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 204 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 23:35:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 2769 states and 3357 transitions. [2023-12-02 23:35:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 3357 transitions. [2023-12-02 23:35:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-02 23:35:26,698 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 204 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 23:35:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 2789 states and 3377 transitions. [2023-12-02 23:35:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3377 transitions. [2023-12-02 23:35:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-02 23:35:27,900 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 23:35:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 2880 states and 3493 transitions. [2023-12-02 23:35:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3493 transitions. [2023-12-02 23:35:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-02 23:35:38,148 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:38,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 23:35:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 2920 states and 3558 transitions. [2023-12-02 23:35:45,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 3558 transitions. [2023-12-02 23:35:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-02 23:35:45,467 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:45,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 23:35:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 2940 states and 3585 transitions. [2023-12-02 23:35:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 3585 transitions. [2023-12-02 23:35:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-02 23:35:48,897 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:48,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 23:35:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 2946 states and 3596 transitions. [2023-12-02 23:35:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3596 transitions. [2023-12-02 23:35:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-02 23:35:50,973 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 23:35:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 2957 states and 3608 transitions. [2023-12-02 23:35:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 3608 transitions. [2023-12-02 23:35:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-02 23:35:52,652 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 23:35:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 2964 states and 3616 transitions. [2023-12-02 23:35:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 3616 transitions. [2023-12-02 23:35:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-02 23:35:53,680 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:53,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 23:35:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 2970 states and 3622 transitions. [2023-12-02 23:35:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 3622 transitions. [2023-12-02 23:35:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-02 23:35:55,751 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 23:35:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 2976 states and 3627 transitions. [2023-12-02 23:35:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3627 transitions. [2023-12-02 23:35:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-02 23:35:56,868 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:56,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 23:35:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:35:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 2978 states and 3628 transitions. [2023-12-02 23:35:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 3628 transitions. [2023-12-02 23:35:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-02 23:35:57,937 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:35:57,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:35:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:35:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 206 proven. 58 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:36:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 2999 states and 3663 transitions. [2023-12-02 23:36:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3663 transitions. [2023-12-02 23:36:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-12-02 23:36:03,910 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:03,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2023-12-02 23:36:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3046 states and 3713 transitions. [2023-12-02 23:36:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 3713 transitions. [2023-12-02 23:36:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-02 23:36:05,870 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:36:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3047 states and 3714 transitions. [2023-12-02 23:36:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 3714 transitions. [2023-12-02 23:36:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-02 23:36:06,391 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:06,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 301 proven. 97 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-02 23:36:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3079 states and 3751 transitions. [2023-12-02 23:36:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 3751 transitions. [2023-12-02 23:36:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-02 23:36:11,122 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:11,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 301 proven. 97 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-02 23:36:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3083 states and 3755 transitions. [2023-12-02 23:36:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3755 transitions. [2023-12-02 23:36:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-02 23:36:12,693 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-12-02 23:36:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3789 states to 3109 states and 3789 transitions. [2023-12-02 23:36:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 3789 transitions. [2023-12-02 23:36:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-02 23:36:18,589 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:18,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-12-02 23:36:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 3131 states and 3812 transitions. [2023-12-02 23:36:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 3812 transitions. [2023-12-02 23:36:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-02 23:36:21,414 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-12-02 23:36:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3182 states and 3865 transitions. [2023-12-02 23:36:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 3865 transitions. [2023-12-02 23:36:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-12-02 23:36:22,832 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:22,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 245 proven. 68 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-12-02 23:36:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3216 states and 3909 transitions. [2023-12-02 23:36:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 3909 transitions. [2023-12-02 23:36:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-12-02 23:36:28,720 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:28,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-02 23:36:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3224 states and 3921 transitions. [2023-12-02 23:36:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 3921 transitions. [2023-12-02 23:36:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-12-02 23:36:31,372 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-02 23:36:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 3234 states and 3934 transitions. [2023-12-02 23:36:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 3934 transitions. [2023-12-02 23:36:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-12-02 23:36:34,047 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:34,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-02 23:36:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3257 states and 3957 transitions. [2023-12-02 23:36:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 3957 transitions. [2023-12-02 23:36:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-12-02 23:36:35,323 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:35,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-02 23:36:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:36,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3270 states and 3970 transitions. [2023-12-02 23:36:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 3970 transitions. [2023-12-02 23:36:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-12-02 23:36:36,633 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:36,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-02 23:36:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3277 states and 3977 transitions. [2023-12-02 23:36:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 3977 transitions. [2023-12-02 23:36:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-12-02 23:36:37,508 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:37,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 217 proven. 68 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:36:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 3323 states and 4028 transitions. [2023-12-02 23:36:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4028 transitions. [2023-12-02 23:36:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-02 23:36:43,868 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:43,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-02 23:36:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 3360 states and 4070 transitions. [2023-12-02 23:36:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 4070 transitions. [2023-12-02 23:36:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-02 23:36:49,967 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-02 23:36:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 3363 states and 4072 transitions. [2023-12-02 23:36:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4072 transitions. [2023-12-02 23:36:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-02 23:36:51,041 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:51,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-02 23:36:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 3370 states and 4078 transitions. [2023-12-02 23:36:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4078 transitions. [2023-12-02 23:36:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-02 23:36:51,606 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-02 23:36:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 3381 states and 4088 transitions. [2023-12-02 23:36:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4088 transitions. [2023-12-02 23:36:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-02 23:36:52,199 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 109 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:36:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 3387 states and 4095 transitions. [2023-12-02 23:36:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4095 transitions. [2023-12-02 23:36:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-02 23:36:53,403 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 109 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:36:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:36:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 3418 states and 4131 transitions. [2023-12-02 23:36:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 4131 transitions. [2023-12-02 23:36:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-02 23:36:58,138 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:36:58,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:36:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:36:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 109 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:37:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 3426 states and 4144 transitions. [2023-12-02 23:37:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 4144 transitions. [2023-12-02 23:37:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-02 23:37:02,196 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:02,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 109 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:37:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 3429 states and 4147 transitions. [2023-12-02 23:37:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4147 transitions. [2023-12-02 23:37:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-02 23:37:04,341 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 109 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:37:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 3450 states and 4170 transitions. [2023-12-02 23:37:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4170 transitions. [2023-12-02 23:37:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-12-02 23:37:07,216 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 109 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:37:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 3456 states and 4177 transitions. [2023-12-02 23:37:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 4177 transitions. [2023-12-02 23:37:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-12-02 23:37:09,200 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:09,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-12-02 23:37:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4194 states to 3472 states and 4194 transitions. [2023-12-02 23:37:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4194 transitions. [2023-12-02 23:37:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-02 23:37:11,031 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:11,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-12-02 23:37:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 3479 states and 4206 transitions. [2023-12-02 23:37:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 4206 transitions. [2023-12-02 23:37:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-02 23:37:13,438 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:13,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-12-02 23:37:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 3484 states and 4211 transitions. [2023-12-02 23:37:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 4211 transitions. [2023-12-02 23:37:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-02 23:37:15,214 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-12-02 23:37:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 3487 states and 4213 transitions. [2023-12-02 23:37:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3487 states and 4213 transitions. [2023-12-02 23:37:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-02 23:37:15,788 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 282 proven. 121 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-02 23:37:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 3536 states and 4271 transitions. [2023-12-02 23:37:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4271 transitions. [2023-12-02 23:37:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-02 23:37:19,588 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:19,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-12-02 23:37:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 3575 states and 4315 transitions. [2023-12-02 23:37:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 4315 transitions. [2023-12-02 23:37:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-02 23:37:23,784 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-12-02 23:37:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 3596 states and 4345 transitions. [2023-12-02 23:37:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 4345 transitions. [2023-12-02 23:37:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-02 23:37:27,964 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-12-02 23:37:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4356 states to 3607 states and 4356 transitions. [2023-12-02 23:37:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 4356 transitions. [2023-12-02 23:37:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-02 23:37:29,448 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:29,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-12-02 23:37:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4367 states to 3618 states and 4367 transitions. [2023-12-02 23:37:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4367 transitions. [2023-12-02 23:37:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-02 23:37:30,531 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:30,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-12-02 23:37:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 3620 states and 4368 transitions. [2023-12-02 23:37:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 4368 transitions. [2023-12-02 23:37:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-02 23:37:31,172 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-12-02 23:37:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4369 states to 3622 states and 4369 transitions. [2023-12-02 23:37:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4369 transitions. [2023-12-02 23:37:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2023-12-02 23:37:31,912 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2023-12-02 23:37:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 3627 states and 4380 transitions. [2023-12-02 23:37:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 4380 transitions. [2023-12-02 23:37:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-02 23:37:32,671 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:37:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2023-12-02 23:37:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:37:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 3669 states and 4423 transitions. [2023-12-02 23:37:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 4423 transitions. [2023-12-02 23:37:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-02 23:37:33,379 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:37:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:37:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:37:33,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 23:37:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:37:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:37:33,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 23:37:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:37:33,801 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 228 iterations. [2023-12-02 23:37:33,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 11:37:33 ImpRootNode [2023-12-02 23:37:33,925 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 23:37:33,926 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 23:37:33,926 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 23:37:33,926 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 23:37:33,926 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:32:07" (3/4) ... [2023-12-02 23:37:33,927 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 23:37:34,202 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 23:37:34,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 23:37:34,203 INFO L158 Benchmark]: Toolchain (without parser) took 328299.41ms. Allocated memory was 153.1MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 111.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-12-02 23:37:34,203 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 23:37:34,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.48ms. Allocated memory is still 153.1MB. Free memory was 111.4MB in the beginning and 83.6MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-12-02 23:37:34,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.62ms. Allocated memory is still 153.1MB. Free memory was 83.6MB in the beginning and 77.9MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 23:37:34,204 INFO L158 Benchmark]: Boogie Preprocessor took 97.69ms. Allocated memory is still 153.1MB. Free memory was 77.9MB in the beginning and 119.1MB in the end (delta: -41.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-12-02 23:37:34,204 INFO L158 Benchmark]: RCFGBuilder took 1268.91ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 119.1MB in the beginning and 116.4MB in the end (delta: 2.6MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2023-12-02 23:37:34,204 INFO L158 Benchmark]: CodeCheck took 326064.64ms. Allocated memory was 205.5MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 116.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-12-02 23:37:34,204 INFO L158 Benchmark]: Witness Printer took 276.24ms. Allocated memory is still 3.2GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-02 23:37:34,206 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: 325.9s, OverallIterations: 228, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 910262 SdHoareTripleChecker+Valid, 1985.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 908454 mSDsluCounter, 146625 SdHoareTripleChecker+Invalid, 1713.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126850 mSDsCounter, 181482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1916972 IncrementalHoareTripleChecker+Invalid, 2098454 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181482 mSolverCounterUnsat, 19775 mSDtfsCounter, 1916972 mSolverCounterSat, 15.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 268915 GetRequests, 258567 SyntacticMatches, 8368 SemanticMatches, 1980 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2562012 ImplicationChecksByTransitivity, 256.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 34.5s InterpolantComputationTime, 40793 NumberOfCodeBlocks, 40793 NumberOfCodeBlocksAsserted, 228 NumberOfCheckSat, 40304 ConstructedInterpolants, 0 QuantifiedInterpolants, 158675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 227 InterpolantComputations, 144 PerfectInterpolantSequences, 39860/44417 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 - CounterExampleResult [Line: 405]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\old(input)=3, \result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\old(input)=4, \result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\old(input)=4, \result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\old(input)=1, \result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L159] a16 = 4 [L160] a17 = 0 [L161] return 25; VAL [\old(input)=4, \result=25, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=3, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND TRUE ((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))) [L242] a8 = 14 [L243] a7 = 0 [L244] a17 = 1 [L245] a21 = 1 [L246] a16 = 4 [L247] return -1; VAL [\old(input)=3, \result=-1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L405] reach_error() VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.48ms. Allocated memory is still 153.1MB. Free memory was 111.4MB in the beginning and 83.6MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.62ms. Allocated memory is still 153.1MB. Free memory was 83.6MB in the beginning and 77.9MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.69ms. Allocated memory is still 153.1MB. Free memory was 77.9MB in the beginning and 119.1MB in the end (delta: -41.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1268.91ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 119.1MB in the beginning and 116.4MB in the end (delta: 2.6MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. * CodeCheck took 326064.64ms. Allocated memory was 205.5MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 116.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 276.24ms. Allocated memory is still 3.2GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-02 23:37:34,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb33ed0b-037d-4ff5-b29a-e4c9aa34c63b/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE