./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.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_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/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_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/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_654c399a-a55c-460d-bf9b-47b480d451f4/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 7b93c3f7fecac47558d01f2a0c93696ea48f2ebbd5c30f43df88a8759c531651 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-03 01:47:23,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-03 01:47:23,777 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-03 01:47:23,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-03 01:47:23,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-03 01:47:23,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-03 01:47:23,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-03 01:47:23,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-03 01:47:23,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-03 01:47:23,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-03 01:47:23,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-03 01:47:23,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-03 01:47:23,808 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-03 01:47:23,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-03 01:47:23,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-03 01:47:23,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-03 01:47:23,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-03 01:47:23,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-03 01:47:23,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-03 01:47:23,811 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-03 01:47:23,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-03 01:47:23,812 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-03 01:47:23,813 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-03 01:47:23,813 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-03 01:47:23,814 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-03 01:47:23,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-03 01:47:23,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 01:47:23,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-03 01:47:23,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-03 01:47:23,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-03 01:47:23,816 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-03 01:47:23,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-03 01:47:23,817 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-03 01:47:23,817 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_654c399a-a55c-460d-bf9b-47b480d451f4/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_654c399a-a55c-460d-bf9b-47b480d451f4/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 -> 7b93c3f7fecac47558d01f2a0c93696ea48f2ebbd5c30f43df88a8759c531651 [2023-12-03 01:47:24,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-03 01:47:24,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-03 01:47:24,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-03 01:47:24,059 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-03 01:47:24,059 INFO L274 PluginConnector]: CDTParser initialized [2023-12-03 01:47:24,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2023-12-03 01:47:26,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-03 01:47:27,004 INFO L384 CDTParser]: Found 1 translation units. [2023-12-03 01:47:27,005 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2023-12-03 01:47:27,018 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/data/cebbb8162/3814a4e7cf0d44d7aec3bca9a33af68d/FLAGcd33c65cd [2023-12-03 01:47:27,030 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/data/cebbb8162/3814a4e7cf0d44d7aec3bca9a33af68d [2023-12-03 01:47:27,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-03 01:47:27,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-03 01:47:27,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-03 01:47:27,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-03 01:47:27,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-03 01:47:27,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc6d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27, skipping insertion in model container [2023-12-03 01:47:27,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,090 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-03 01:47:27,316 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_654c399a-a55c-460d-bf9b-47b480d451f4/sv-benchmarks/c/eca-rers2012/Problem01_label56.c[15002,15015] [2023-12-03 01:47:27,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 01:47:27,369 INFO L202 MainTranslator]: Completed pre-run [2023-12-03 01:47:27,451 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_654c399a-a55c-460d-bf9b-47b480d451f4/sv-benchmarks/c/eca-rers2012/Problem01_label56.c[15002,15015] [2023-12-03 01:47:27,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 01:47:27,492 INFO L206 MainTranslator]: Completed translation [2023-12-03 01:47:27,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27 WrapperNode [2023-12-03 01:47:27,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-03 01:47:27,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-03 01:47:27,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-03 01:47:27,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-03 01:47:27,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,566 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2023-12-03 01:47:27,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-03 01:47:27,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-03 01:47:27,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-03 01:47:27,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-03 01:47:27,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-03 01:47:27,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-03 01:47:27,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-03 01:47:27,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-03 01:47:27,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:27" (1/1) ... [2023-12-03 01:47:27,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 01:47:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-03 01:47:27,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-03 01:47:27,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-03 01:47:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-03 01:47:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-03 01:47:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-03 01:47:27,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-03 01:47:27,780 INFO L241 CfgBuilder]: Building ICFG [2023-12-03 01:47:27,782 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-03 01:47:28,654 INFO L282 CfgBuilder]: Performing block encoding [2023-12-03 01:47:28,892 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-03 01:47:28,893 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-03 01:47:28,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:47:28 BoogieIcfgContainer [2023-12-03 01:47:28,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-03 01:47:28,895 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-03 01:47:28,895 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-03 01:47:28,904 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-03 01:47:28,904 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:47:28" (1/1) ... [2023-12-03 01:47:28,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-03 01:47:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2023-12-03 01:47:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2023-12-03 01:47:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-03 01:47:28,961 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:29,264 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-03 01:47:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2023-12-03 01:47:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2023-12-03 01:47:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:47:29,730 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:29,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:47:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2023-12-03 01:47:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2023-12-03 01:47:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-03 01:47:30,042 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:30,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2023-12-03 01:47:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2023-12-03 01:47:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-03 01:47:30,211 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:30,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:47:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2023-12-03 01:47:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2023-12-03 01:47:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-03 01:47:30,446 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:30,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2023-12-03 01:47:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2023-12-03 01:47:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-03 01:47:30,729 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:30,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2023-12-03 01:47:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2023-12-03 01:47:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-03 01:47:30,976 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:30,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:31,111 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-03 01:47:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2023-12-03 01:47:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2023-12-03 01:47:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-03 01:47:31,237 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:31,415 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-03 01:47:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2023-12-03 01:47:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2023-12-03 01:47:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-03 01:47:31,687 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:31,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2023-12-03 01:47:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2023-12-03 01:47:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-03 01:47:32,156 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:32,339 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-03 01:47:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2023-12-03 01:47:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2023-12-03 01:47:32,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-03 01:47:32,917 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2023-12-03 01:47:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2023-12-03 01:47:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-03 01:47:33,635 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:33,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2023-12-03 01:47:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2023-12-03 01:47:33,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-03 01:47:33,964 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2023-12-03 01:47:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2023-12-03 01:47:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-03 01:47:34,154 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:34,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:47:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2023-12-03 01:47:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2023-12-03 01:47:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-03 01:47:34,451 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:34,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2023-12-03 01:47:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2023-12-03 01:47:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-03 01:47:35,268 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2023-12-03 01:47:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2023-12-03 01:47:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-03 01:47:35,468 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:35,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2023-12-03 01:47:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2023-12-03 01:47:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-03 01:47:35,991 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:35,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:47:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2023-12-03 01:47:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2023-12-03 01:47:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-03 01:47:36,757 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:36,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2023-12-03 01:47:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2023-12-03 01:47:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-03 01:47:36,883 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:36,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:47:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2023-12-03 01:47:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2023-12-03 01:47:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-03 01:47:37,317 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:37,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:47:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2023-12-03 01:47:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2023-12-03 01:47:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-03 01:47:37,780 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:47:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2023-12-03 01:47:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2023-12-03 01:47:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-03 01:47:38,211 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:38,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:47:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2023-12-03 01:47:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2023-12-03 01:47:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-03 01:47:38,519 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2023-12-03 01:47:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2023-12-03 01:47:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-03 01:47:38,989 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2023-12-03 01:47:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2023-12-03 01:47:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-03 01:47:39,348 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:39,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2023-12-03 01:47:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2023-12-03 01:47:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-03 01:47:39,710 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:47:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2023-12-03 01:47:39,993 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2023-12-03 01:47:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-03 01:47:39,994 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:39,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:47:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2023-12-03 01:47:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2023-12-03 01:47:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-03 01:47:40,116 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:40,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:40,231 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-03 01:47:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2023-12-03 01:47:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2023-12-03 01:47:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-03 01:47:40,271 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:40,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2023-12-03 01:47:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2023-12-03 01:47:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-03 01:47:40,811 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2023-12-03 01:47:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2023-12-03 01:47:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-03 01:47:41,131 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:47:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2023-12-03 01:47:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2023-12-03 01:47:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-03 01:47:41,340 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:41,532 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-03 01:47:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2023-12-03 01:47:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2023-12-03 01:47:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-03 01:47:41,827 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:41,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:47:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2023-12-03 01:47:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2023-12-03 01:47:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-03 01:47:42,189 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:47:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2023-12-03 01:47:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2023-12-03 01:47:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-03 01:47:42,501 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:42,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:47:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2023-12-03 01:47:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2023-12-03 01:47:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-03 01:47:42,801 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:42,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-03 01:47:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 484 states and 656 transitions. [2023-12-03 01:47:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 656 transitions. [2023-12-03 01:47:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-03 01:47:43,499 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 486 states and 658 transitions. [2023-12-03 01:47:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 658 transitions. [2023-12-03 01:47:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-03 01:47:43,598 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 497 states and 672 transitions. [2023-12-03 01:47:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 672 transitions. [2023-12-03 01:47:43,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-03 01:47:43,795 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:43,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 504 states and 680 transitions. [2023-12-03 01:47:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 680 transitions. [2023-12-03 01:47:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-03 01:47:43,987 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:47:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 506 states and 682 transitions. [2023-12-03 01:47:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 682 transitions. [2023-12-03 01:47:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-03 01:47:44,070 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:44,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:47:44,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 513 states and 689 transitions. [2023-12-03 01:47:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 689 transitions. [2023-12-03 01:47:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-03 01:47:44,245 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:44,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 551 states and 733 transitions. [2023-12-03 01:47:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 733 transitions. [2023-12-03 01:47:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-03 01:47:45,059 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 554 states and 735 transitions. [2023-12-03 01:47:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 735 transitions. [2023-12-03 01:47:45,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-03 01:47:45,328 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:45,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 557 states and 737 transitions. [2023-12-03 01:47:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 737 transitions. [2023-12-03 01:47:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-03 01:47:45,607 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:47:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 566 states and 745 transitions. [2023-12-03 01:47:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 745 transitions. [2023-12-03 01:47:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-03 01:47:45,733 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 574 states and 753 transitions. [2023-12-03 01:47:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 753 transitions. [2023-12-03 01:47:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-03 01:47:45,946 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:45,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 605 states and 788 transitions. [2023-12-03 01:47:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 788 transitions. [2023-12-03 01:47:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-03 01:47:46,856 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-03 01:47:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 636 states and 825 transitions. [2023-12-03 01:47:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 825 transitions. [2023-12-03 01:47:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-03 01:47:47,664 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:47:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 645 states and 835 transitions. [2023-12-03 01:47:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 835 transitions. [2023-12-03 01:47:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-03 01:47:47,770 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:47:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 695 states and 893 transitions. [2023-12-03 01:47:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 893 transitions. [2023-12-03 01:47:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-03 01:47:49,033 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-03 01:47:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 698 states and 896 transitions. [2023-12-03 01:47:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 896 transitions. [2023-12-03 01:47:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-03 01:47:49,459 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:49,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 725 states and 926 transitions. [2023-12-03 01:47:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 926 transitions. [2023-12-03 01:47:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-03 01:47:49,707 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-03 01:47:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 744 states and 949 transitions. [2023-12-03 01:47:50,720 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 949 transitions. [2023-12-03 01:47:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-03 01:47:50,721 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:50,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 761 states and 966 transitions. [2023-12-03 01:47:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 966 transitions. [2023-12-03 01:47:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-03 01:47:50,962 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 784 states and 990 transitions. [2023-12-03 01:47:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 990 transitions. [2023-12-03 01:47:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-03 01:47:51,378 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 853 states and 1086 transitions. [2023-12-03 01:47:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1086 transitions. [2023-12-03 01:47:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-03 01:47:54,410 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 884 states and 1124 transitions. [2023-12-03 01:47:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1124 transitions. [2023-12-03 01:47:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-03 01:47:56,313 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 891 states and 1133 transitions. [2023-12-03 01:47:57,321 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1133 transitions. [2023-12-03 01:47:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-03 01:47:57,322 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-03 01:47:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 892 states and 1133 transitions. [2023-12-03 01:47:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1133 transitions. [2023-12-03 01:47:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-03 01:47:57,464 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 915 states and 1157 transitions. [2023-12-03 01:47:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1157 transitions. [2023-12-03 01:47:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-03 01:47:58,458 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:47:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:47:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 942 states and 1188 transitions. [2023-12-03 01:47:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1188 transitions. [2023-12-03 01:47:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-03 01:47:59,137 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:47:59,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:47:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:47:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1008 states and 1260 transitions. [2023-12-03 01:48:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1260 transitions. [2023-12-03 01:48:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-03 01:48:01,009 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 01:48:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1019 states and 1271 transitions. [2023-12-03 01:48:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1271 transitions. [2023-12-03 01:48:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-03 01:48:01,241 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:48:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1036 states and 1290 transitions. [2023-12-03 01:48:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1290 transitions. [2023-12-03 01:48:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-03 01:48:02,139 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1053 states and 1307 transitions. [2023-12-03 01:48:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1307 transitions. [2023-12-03 01:48:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-03 01:48:02,791 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-03 01:48:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1054 states and 1308 transitions. [2023-12-03 01:48:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1308 transitions. [2023-12-03 01:48:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-03 01:48:03,026 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:03,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1137 states and 1406 transitions. [2023-12-03 01:48:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1406 transitions. [2023-12-03 01:48:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-03 01:48:06,142 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:06,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-03 01:48:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1186 states and 1457 transitions. [2023-12-03 01:48:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1457 transitions. [2023-12-03 01:48:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-03 01:48:06,778 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:06,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:48:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1221 states and 1499 transitions. [2023-12-03 01:48:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1499 transitions. [2023-12-03 01:48:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-03 01:48:08,569 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:48:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1226 states and 1503 transitions. [2023-12-03 01:48:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1503 transitions. [2023-12-03 01:48:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-03 01:48:09,000 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:09,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:48:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1235 states and 1514 transitions. [2023-12-03 01:48:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1514 transitions. [2023-12-03 01:48:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-03 01:48:09,709 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:48:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1306 states and 1587 transitions. [2023-12-03 01:48:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1587 transitions. [2023-12-03 01:48:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-03 01:48:11,875 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:11,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:48:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1326 states and 1606 transitions. [2023-12-03 01:48:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1606 transitions. [2023-12-03 01:48:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-03 01:48:12,692 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-03 01:48:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1331 states and 1612 transitions. [2023-12-03 01:48:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1612 transitions. [2023-12-03 01:48:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-03 01:48:12,812 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-03 01:48:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1370 states and 1658 transitions. [2023-12-03 01:48:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1658 transitions. [2023-12-03 01:48:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-03 01:48:14,571 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-03 01:48:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1406 states and 1696 transitions. [2023-12-03 01:48:15,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1696 transitions. [2023-12-03 01:48:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-03 01:48:15,655 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:15,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-03 01:48:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1410 states and 1699 transitions. [2023-12-03 01:48:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1699 transitions. [2023-12-03 01:48:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-03 01:48:16,067 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-03 01:48:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1417 states and 1705 transitions. [2023-12-03 01:48:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1705 transitions. [2023-12-03 01:48:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-03 01:48:16,461 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:16,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-03 01:48:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1418 states and 1706 transitions. [2023-12-03 01:48:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1706 transitions. [2023-12-03 01:48:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-03 01:48:16,777 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-03 01:48:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1450 states and 1740 transitions. [2023-12-03 01:48:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1740 transitions. [2023-12-03 01:48:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-03 01:48:18,040 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-03 01:48:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1477 states and 1767 transitions. [2023-12-03 01:48:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1767 transitions. [2023-12-03 01:48:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-03 01:48:19,013 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-03 01:48:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1506 states and 1796 transitions. [2023-12-03 01:48:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1796 transitions. [2023-12-03 01:48:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-03 01:48:19,954 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1597 states and 1908 transitions. [2023-12-03 01:48:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 1908 transitions. [2023-12-03 01:48:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-03 01:48:23,618 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:23,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1599 states and 1909 transitions. [2023-12-03 01:48:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 1909 transitions. [2023-12-03 01:48:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-03 01:48:24,217 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1649 states and 1978 transitions. [2023-12-03 01:48:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1978 transitions. [2023-12-03 01:48:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-03 01:48:28,038 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 1668 states and 2004 transitions. [2023-12-03 01:48:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2004 transitions. [2023-12-03 01:48:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-03 01:48:30,041 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 1671 states and 2007 transitions. [2023-12-03 01:48:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2007 transitions. [2023-12-03 01:48:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-03 01:48:30,765 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-03 01:48:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 1674 states and 2008 transitions. [2023-12-03 01:48:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2008 transitions. [2023-12-03 01:48:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-03 01:48:31,249 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:31,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-03 01:48:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 1744 states and 2080 transitions. [2023-12-03 01:48:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2080 transitions. [2023-12-03 01:48:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 01:48:31,846 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:31,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 1749 states and 2092 transitions. [2023-12-03 01:48:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2092 transitions. [2023-12-03 01:48:33,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 01:48:33,306 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 1750 states and 2092 transitions. [2023-12-03 01:48:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2092 transitions. [2023-12-03 01:48:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 01:48:33,983 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:33,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 1751 states and 2092 transitions. [2023-12-03 01:48:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2092 transitions. [2023-12-03 01:48:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-03 01:48:34,641 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-03 01:48:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 1798 states and 2145 transitions. [2023-12-03 01:48:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2145 transitions. [2023-12-03 01:48:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-03 01:48:35,456 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:35,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 1867 states and 2230 transitions. [2023-12-03 01:48:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2230 transitions. [2023-12-03 01:48:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-03 01:48:37,558 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:37,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 1886 states and 2254 transitions. [2023-12-03 01:48:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2254 transitions. [2023-12-03 01:48:39,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-03 01:48:39,701 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:39,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 01:48:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 1889 states and 2256 transitions. [2023-12-03 01:48:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2256 transitions. [2023-12-03 01:48:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-03 01:48:40,068 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:40,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-12-03 01:48:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 1891 states and 2257 transitions. [2023-12-03 01:48:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2257 transitions. [2023-12-03 01:48:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-03 01:48:40,210 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:40,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-03 01:48:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 1904 states and 2270 transitions. [2023-12-03 01:48:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2270 transitions. [2023-12-03 01:48:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-03 01:48:41,378 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:41,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-03 01:48:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 1907 states and 2272 transitions. [2023-12-03 01:48:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2272 transitions. [2023-12-03 01:48:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-03 01:48:41,936 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:41,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-03 01:48:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 1910 states and 2275 transitions. [2023-12-03 01:48:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2275 transitions. [2023-12-03 01:48:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 01:48:42,591 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:42,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 1931 states and 2297 transitions. [2023-12-03 01:48:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2297 transitions. [2023-12-03 01:48:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-12-03 01:48:43,987 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 1934 states and 2300 transitions. [2023-12-03 01:48:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2300 transitions. [2023-12-03 01:48:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-03 01:48:44,821 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:44,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 1972 states and 2345 transitions. [2023-12-03 01:48:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2345 transitions. [2023-12-03 01:48:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-03 01:48:48,113 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:48,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 01:48:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 1987 states and 2364 transitions. [2023-12-03 01:48:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2364 transitions. [2023-12-03 01:48:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-12-03 01:48:48,858 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-03 01:48:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 1992 states and 2371 transitions. [2023-12-03 01:48:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2371 transitions. [2023-12-03 01:48:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-03 01:48:49,265 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-03 01:48:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2062 states and 2443 transitions. [2023-12-03 01:48:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2443 transitions. [2023-12-03 01:48:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-03 01:48:49,932 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:49,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2133 states and 2521 transitions. [2023-12-03 01:48:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2521 transitions. [2023-12-03 01:48:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-12-03 01:48:51,854 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:51,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:48:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2186 states and 2584 transitions. [2023-12-03 01:48:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2584 transitions. [2023-12-03 01:48:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-03 01:48:55,427 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:55,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-03 01:48:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:48:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2236 states and 2648 transitions. [2023-12-03 01:48:57,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2648 transitions. [2023-12-03 01:48:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-03 01:48:57,290 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:48:57,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:48:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:48:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-03 01:49:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2274 states and 2691 transitions. [2023-12-03 01:49:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2691 transitions. [2023-12-03 01:49:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-03 01:49:01,094 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:49:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2309 states and 2731 transitions. [2023-12-03 01:49:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2731 transitions. [2023-12-03 01:49:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-03 01:49:04,647 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:04,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:49:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2312 states and 2734 transitions. [2023-12-03 01:49:05,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2734 transitions. [2023-12-03 01:49:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 01:49:05,535 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-03 01:49:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2358 states and 2795 transitions. [2023-12-03 01:49:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2795 transitions. [2023-12-03 01:49:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 01:49:09,691 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:09,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-03 01:49:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2362 states and 2798 transitions. [2023-12-03 01:49:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2798 transitions. [2023-12-03 01:49:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 01:49:10,655 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 137 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-03 01:49:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2368 states and 2805 transitions. [2023-12-03 01:49:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 2805 transitions. [2023-12-03 01:49:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 01:49:11,103 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:11,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-03 01:49:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2420 states and 2866 transitions. [2023-12-03 01:49:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2866 transitions. [2023-12-03 01:49:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 01:49:13,317 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:13,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-03 01:49:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2426 states and 2872 transitions. [2023-12-03 01:49:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2872 transitions. [2023-12-03 01:49:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 01:49:14,336 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 01:49:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2459 states and 2910 transitions. [2023-12-03 01:49:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 2910 transitions. [2023-12-03 01:49:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 01:49:16,408 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:49:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2472 states and 2922 transitions. [2023-12-03 01:49:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 2922 transitions. [2023-12-03 01:49:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:17,140 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-12-03 01:49:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2508 states and 2958 transitions. [2023-12-03 01:49:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 2958 transitions. [2023-12-03 01:49:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:17,476 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 2547 states and 3031 transitions. [2023-12-03 01:49:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 3031 transitions. [2023-12-03 01:49:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:20,819 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 2551 states and 3037 transitions. [2023-12-03 01:49:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3037 transitions. [2023-12-03 01:49:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:22,016 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:22,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 2565 states and 3054 transitions. [2023-12-03 01:49:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3054 transitions. [2023-12-03 01:49:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:23,589 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 2568 states and 3056 transitions. [2023-12-03 01:49:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3056 transitions. [2023-12-03 01:49:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:24,168 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:24,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 2571 states and 3058 transitions. [2023-12-03 01:49:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3058 transitions. [2023-12-03 01:49:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:24,741 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 2585 states and 3073 transitions. [2023-12-03 01:49:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3073 transitions. [2023-12-03 01:49:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:25,719 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:25,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 2588 states and 3075 transitions. [2023-12-03 01:49:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3075 transitions. [2023-12-03 01:49:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:26,290 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:26,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 2591 states and 3077 transitions. [2023-12-03 01:49:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3077 transitions. [2023-12-03 01:49:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:26,958 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 2595 states and 3080 transitions. [2023-12-03 01:49:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3080 transitions. [2023-12-03 01:49:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:27,582 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 2599 states and 3084 transitions. [2023-12-03 01:49:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3084 transitions. [2023-12-03 01:49:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:27,769 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:27,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 2608 states and 3097 transitions. [2023-12-03 01:49:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 3097 transitions. [2023-12-03 01:49:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:28,757 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:28,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 2611 states and 3099 transitions. [2023-12-03 01:49:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3099 transitions. [2023-12-03 01:49:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:29,309 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:29,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 2619 states and 3111 transitions. [2023-12-03 01:49:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3111 transitions. [2023-12-03 01:49:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:30,296 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:30,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 2622 states and 3115 transitions. [2023-12-03 01:49:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3115 transitions. [2023-12-03 01:49:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:31,313 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 2626 states and 3119 transitions. [2023-12-03 01:49:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 3119 transitions. [2023-12-03 01:49:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:31,880 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:31,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 2628 states and 3120 transitions. [2023-12-03 01:49:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 3120 transitions. [2023-12-03 01:49:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-03 01:49:32,487 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 01:49:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 2630 states and 3121 transitions. [2023-12-03 01:49:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3121 transitions. [2023-12-03 01:49:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-03 01:49:33,016 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-03 01:49:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 2637 states and 3126 transitions. [2023-12-03 01:49:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3126 transitions. [2023-12-03 01:49:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-03 01:49:33,703 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:33,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-03 01:49:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 2649 states and 3136 transitions. [2023-12-03 01:49:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3136 transitions. [2023-12-03 01:49:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-03 01:49:34,224 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:34,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-03 01:49:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:35,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 2664 states and 3153 transitions. [2023-12-03 01:49:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3153 transitions. [2023-12-03 01:49:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-03 01:49:35,128 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:49:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-03 01:49:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:49:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 2701 states and 3197 transitions. [2023-12-03 01:49:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3197 transitions. [2023-12-03 01:49:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2023-12-03 01:49:37,405 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:49:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:49:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:49:37,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 01:49:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:49:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:49:37,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 01:49:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:49:37,807 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 143 iterations. [2023-12-03 01:49:37,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 01:49:37 ImpRootNode [2023-12-03 01:49:37,932 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-03 01:49:37,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-03 01:49:37,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-03 01:49:37,933 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-03 01:49:37,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:47:28" (3/4) ... [2023-12-03 01:49:37,934 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-03 01:49:38,258 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-03 01:49:38,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-03 01:49:38,259 INFO L158 Benchmark]: Toolchain (without parser) took 131225.38ms. Allocated memory was 159.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 119.6MB in the beginning and 660.1MB in the end (delta: -540.4MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-12-03 01:49:38,259 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-03 01:49:38,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.89ms. Allocated memory is still 159.4MB. Free memory was 119.6MB in the beginning and 91.6MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-03 01:49:38,260 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.15ms. Allocated memory is still 159.4MB. Free memory was 91.6MB in the beginning and 85.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-03 01:49:38,260 INFO L158 Benchmark]: Boogie Preprocessor took 65.69ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 81.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-03 01:49:38,261 INFO L158 Benchmark]: RCFGBuilder took 1260.98ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 81.2MB in the beginning and 172.3MB in the end (delta: -91.2MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2023-12-03 01:49:38,261 INFO L158 Benchmark]: CodeCheck took 129036.42ms. Allocated memory was 211.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 172.3MB in the beginning and 685.2MB in the end (delta: -512.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-12-03 01:49:38,262 INFO L158 Benchmark]: Witness Printer took 326.04ms. Allocated memory is still 1.9GB. Free memory was 685.2MB in the beginning and 660.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-12-03 01:49:38,263 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: 128.9s, OverallIterations: 143, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386797 SdHoareTripleChecker+Valid, 840.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382282 mSDsluCounter, 49504 SdHoareTripleChecker+Invalid, 719.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41880 mSDsCounter, 93194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 839604 IncrementalHoareTripleChecker+Invalid, 932798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93194 mSolverCounterUnsat, 7624 mSDtfsCounter, 839604 mSolverCounterSat, 6.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149389 GetRequests, 143689 SyntacticMatches, 4568 SemanticMatches, 1132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860161 ImplicationChecksByTransitivity, 88.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 22124 NumberOfCodeBlocks, 22124 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 21746 ConstructedInterpolants, 0 QuantifiedInterpolants, 99605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 142 InterpolantComputations, 94 PerfectInterpolantSequences, 15640/17657 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: 414]: 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L234] a21 = 1 [L235] a8 = 14 [L236] a16 = 4 [L237] a20 = 0 [L238] a7 = 0 [L239] a17 = 0 [L240] return -1; VAL [\old(input)=2, \result=-1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=2, 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=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=4, a17=0, a20=0, 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] [L413] 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=0, a20=0, 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] [L414] reach_error() VAL [\old(input)=1, a12=8, a16=4, a17=0, a20=0, 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.21ms. Allocated memory is still 100.7MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.89ms. Allocated memory is still 159.4MB. Free memory was 119.6MB in the beginning and 91.6MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.15ms. Allocated memory is still 159.4MB. Free memory was 91.6MB in the beginning and 85.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.69ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 81.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1260.98ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 81.2MB in the beginning and 172.3MB in the end (delta: -91.2MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * CodeCheck took 129036.42ms. Allocated memory was 211.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 172.3MB in the beginning and 685.2MB in the end (delta: -512.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 326.04ms. Allocated memory is still 1.9GB. Free memory was 685.2MB in the beginning and 660.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-03 01:49:38,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654c399a-a55c-460d-bf9b-47b480d451f4/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