./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label35.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_45c94003-329f-46c7-a178-c28d3346a196/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/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_45c94003-329f-46c7-a178-c28d3346a196/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label35.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/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_45c94003-329f-46c7-a178-c28d3346a196/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 f4b477d0e6c60065d1b46e04f151e6fb74d379cb060b8e0e07c8eed55b9ff4ba --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-03 01:04:46,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-03 01:04:46,637 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-03 01:04:46,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-03 01:04:46,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-03 01:04:46,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-03 01:04:46,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-03 01:04:46,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-03 01:04:46,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-03 01:04:46,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-03 01:04:46,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-03 01:04:46,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-03 01:04:46,685 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-03 01:04:46,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-03 01:04:46,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-03 01:04:46,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-03 01:04:46,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-03 01:04:46,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-03 01:04:46,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-03 01:04:46,693 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-03 01:04:46,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-03 01:04:46,696 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-03 01:04:46,697 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-03 01:04:46,697 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-03 01:04:46,698 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-03 01:04:46,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-03 01:04:46,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 01:04:46,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-03 01:04:46,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-03 01:04:46,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-03 01:04:46,701 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-03 01:04:46,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-03 01:04:46,702 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-03 01:04:46,703 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_45c94003-329f-46c7-a178-c28d3346a196/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_45c94003-329f-46c7-a178-c28d3346a196/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 -> f4b477d0e6c60065d1b46e04f151e6fb74d379cb060b8e0e07c8eed55b9ff4ba [2023-12-03 01:04:46,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-03 01:04:46,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-03 01:04:46,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-03 01:04:46,991 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-03 01:04:46,992 INFO L274 PluginConnector]: CDTParser initialized [2023-12-03 01:04:46,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/eca-rers2012/Problem01_label35.c [2023-12-03 01:04:49,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-03 01:04:50,264 INFO L384 CDTParser]: Found 1 translation units. [2023-12-03 01:04:50,265 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/sv-benchmarks/c/eca-rers2012/Problem01_label35.c [2023-12-03 01:04:50,279 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/bin/ukojak-verify-Qdu7aM0XO9/data/a903c98eb/9740ae95405e41229b866664fb267d29/FLAG353d9c156 [2023-12-03 01:04:50,295 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/bin/ukojak-verify-Qdu7aM0XO9/data/a903c98eb/9740ae95405e41229b866664fb267d29 [2023-12-03 01:04:50,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-03 01:04:50,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-03 01:04:50,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-03 01:04:50,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-03 01:04:50,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-03 01:04:50,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:50,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e03b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50, skipping insertion in model container [2023-12-03 01:04:50,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:50,367 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-03 01:04:50,648 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_45c94003-329f-46c7-a178-c28d3346a196/sv-benchmarks/c/eca-rers2012/Problem01_label35.c[15502,15515] [2023-12-03 01:04:50,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 01:04:50,704 INFO L202 MainTranslator]: Completed pre-run [2023-12-03 01:04:50,782 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_45c94003-329f-46c7-a178-c28d3346a196/sv-benchmarks/c/eca-rers2012/Problem01_label35.c[15502,15515] [2023-12-03 01:04:50,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 01:04:50,820 INFO L206 MainTranslator]: Completed translation [2023-12-03 01:04:50,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50 WrapperNode [2023-12-03 01:04:50,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-03 01:04:50,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-03 01:04:50,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-03 01:04:50,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-03 01:04:50,837 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:04:50" (1/1) ... [2023-12-03 01:04:50,857 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:04:50" (1/1) ... [2023-12-03 01:04:50,920 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2023-12-03 01:04:50,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-03 01:04:50,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-03 01:04:50,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-03 01:04:50,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-03 01:04:50,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:50,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:50,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:50,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:50,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:50,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:50,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:51,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:51,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-03 01:04:51,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-03 01:04:51,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-03 01:04:51,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-03 01:04:51,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:04:50" (1/1) ... [2023-12-03 01:04:51,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 01:04:51,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-03 01:04:51,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/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:04:51,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/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:04:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-03 01:04:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-03 01:04:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-03 01:04:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-03 01:04:51,256 INFO L241 CfgBuilder]: Building ICFG [2023-12-03 01:04:51,259 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-03 01:04:52,412 INFO L282 CfgBuilder]: Performing block encoding [2023-12-03 01:04:52,650 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-03 01:04:52,650 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-03 01:04:52,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:04:52 BoogieIcfgContainer [2023-12-03 01:04:52,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-03 01:04:52,653 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-03 01:04:52,654 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-03 01:04:52,665 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-03 01:04:52,666 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:04:52" (1/1) ... [2023-12-03 01:04:52,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-03 01:04:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2023-12-03 01:04:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2023-12-03 01:04:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-03 01:04:52,744 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:53,188 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:04:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2023-12-03 01:04:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2023-12-03 01:04:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:04:53,966 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:54,139 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:04:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2023-12-03 01:04:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2023-12-03 01:04:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-03 01:04:54,396 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:04:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2023-12-03 01:04:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2023-12-03 01:04:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-03 01:04:54,595 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:04:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 221 states and 299 transitions. [2023-12-03 01:04:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2023-12-03 01:04:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-03 01:04:55,232 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:55,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:04:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 228 states and 308 transitions. [2023-12-03 01:04:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2023-12-03 01:04:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-03 01:04:55,533 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:55,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:04:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 239 states and 323 transitions. [2023-12-03 01:04:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2023-12-03 01:04:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-03 01:04:56,115 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:56,257 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:04:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 248 states and 332 transitions. [2023-12-03 01:04:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 332 transitions. [2023-12-03 01:04:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-03 01:04:56,333 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:04:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 256 states and 342 transitions. [2023-12-03 01:04:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 342 transitions. [2023-12-03 01:04:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-03 01:04:56,698 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-03 01:04:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 264 states and 355 transitions. [2023-12-03 01:04:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2023-12-03 01:04:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-03 01:04:57,033 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:57,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:04:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2023-12-03 01:04:57,481 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2023-12-03 01:04:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-03 01:04:57,482 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-03 01:04:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 285 states and 380 transitions. [2023-12-03 01:04:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2023-12-03 01:04:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-03 01:04:57,754 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:57,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-03 01:04:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 292 states and 389 transitions. [2023-12-03 01:04:58,121 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 389 transitions. [2023-12-03 01:04:58,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-03 01:04:58,122 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:58,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:04:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 295 states and 393 transitions. [2023-12-03 01:04:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 393 transitions. [2023-12-03 01:04:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-03 01:04:58,479 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:58,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 01:04:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 296 states and 395 transitions. [2023-12-03 01:04:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2023-12-03 01:04:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-03 01:04:58,649 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:58,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-03 01:04:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:04:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 312 states and 416 transitions. [2023-12-03 01:04:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 416 transitions. [2023-12-03 01:04:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-03 01:04:59,350 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:04:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:04:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:04:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:05:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 327 states and 434 transitions. [2023-12-03 01:05:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 434 transitions. [2023-12-03 01:05:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-03 01:05:00,238 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:00,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 01:05:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 338 states and 447 transitions. [2023-12-03 01:05:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2023-12-03 01:05:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-03 01:05:00,774 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:00,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 01:05:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 345 states and 456 transitions. [2023-12-03 01:05:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2023-12-03 01:05:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-03 01:05:01,029 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:05:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 354 states and 467 transitions. [2023-12-03 01:05:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 467 transitions. [2023-12-03 01:05:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-03 01:05:01,147 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:01,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-03 01:05:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 368 states and 481 transitions. [2023-12-03 01:05:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 481 transitions. [2023-12-03 01:05:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-03 01:05:01,393 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 01:05:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 372 states and 485 transitions. [2023-12-03 01:05:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 485 transitions. [2023-12-03 01:05:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-03 01:05:01,480 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:05:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 381 states and 496 transitions. [2023-12-03 01:05:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 496 transitions. [2023-12-03 01:05:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-03 01:05:01,769 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-03 01:05:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 395 states and 511 transitions. [2023-12-03 01:05:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 511 transitions. [2023-12-03 01:05:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-03 01:05:02,251 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 01:05:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 397 states and 513 transitions. [2023-12-03 01:05:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 513 transitions. [2023-12-03 01:05:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-03 01:05:02,380 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 01:05:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 398 states and 514 transitions. [2023-12-03 01:05:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 514 transitions. [2023-12-03 01:05:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-03 01:05:02,463 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:05:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 415 states and 532 transitions. [2023-12-03 01:05:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 532 transitions. [2023-12-03 01:05:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-03 01:05:02,703 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-03 01:05:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 418 states and 536 transitions. [2023-12-03 01:05:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 536 transitions. [2023-12-03 01:05:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-03 01:05:02,865 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:02,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:02,928 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:05:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 441 states and 561 transitions. [2023-12-03 01:05:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 561 transitions. [2023-12-03 01:05:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-03 01:05:03,059 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:03,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-03 01:05:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 456 states and 577 transitions. [2023-12-03 01:05:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 577 transitions. [2023-12-03 01:05:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-03 01:05:03,332 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:03,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:05:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 468 states and 590 transitions. [2023-12-03 01:05:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 590 transitions. [2023-12-03 01:05:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-03 01:05:03,518 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:03,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:05:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 476 states and 604 transitions. [2023-12-03 01:05:04,145 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 604 transitions. [2023-12-03 01:05:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-03 01:05:04,147 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:04,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:04,272 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:05:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 495 states and 625 transitions. [2023-12-03 01:05:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 625 transitions. [2023-12-03 01:05:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-03 01:05:04,448 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:05:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 497 states and 627 transitions. [2023-12-03 01:05:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 627 transitions. [2023-12-03 01:05:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-03 01:05:04,731 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-03 01:05:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 511 states and 641 transitions. [2023-12-03 01:05:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 641 transitions. [2023-12-03 01:05:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-03 01:05:04,926 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:04,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:05:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 519 states and 652 transitions. [2023-12-03 01:05:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 652 transitions. [2023-12-03 01:05:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-03 01:05:05,091 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 01:05:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 520 states and 653 transitions. [2023-12-03 01:05:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 653 transitions. [2023-12-03 01:05:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-03 01:05:05,195 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:05,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 01:05:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 550 states and 685 transitions. [2023-12-03 01:05:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 685 transitions. [2023-12-03 01:05:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-03 01:05:05,544 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-03 01:05:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 590 states and 727 transitions. [2023-12-03 01:05:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 727 transitions. [2023-12-03 01:05:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-03 01:05:06,384 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:06,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-03 01:05:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 595 states and 732 transitions. [2023-12-03 01:05:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 732 transitions. [2023-12-03 01:05:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-03 01:05:06,670 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-03 01:05:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 600 states and 738 transitions. [2023-12-03 01:05:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 738 transitions. [2023-12-03 01:05:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-03 01:05:06,876 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:06,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:07,060 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:05:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 606 states and 746 transitions. [2023-12-03 01:05:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 746 transitions. [2023-12-03 01:05:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-03 01:05:07,415 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:07,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:05:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 746 states and 895 transitions. [2023-12-03 01:05:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 895 transitions. [2023-12-03 01:05:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-03 01:05:08,920 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:08,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:05:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 817 states and 981 transitions. [2023-12-03 01:05:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 981 transitions. [2023-12-03 01:05:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-03 01:05:11,006 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:11,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:05:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 846 states and 1013 transitions. [2023-12-03 01:05:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1013 transitions. [2023-12-03 01:05:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-03 01:05:11,246 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:11,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 01:05:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 858 states and 1026 transitions. [2023-12-03 01:05:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1026 transitions. [2023-12-03 01:05:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-03 01:05:11,399 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 01:05:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 929 states and 1097 transitions. [2023-12-03 01:05:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1097 transitions. [2023-12-03 01:05:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-03 01:05:12,863 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:12,991 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:05:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 958 states and 1126 transitions. [2023-12-03 01:05:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1126 transitions. [2023-12-03 01:05:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-03 01:05:13,515 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:13,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 102 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-03 01:05:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 999 states and 1170 transitions. [2023-12-03 01:05:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1170 transitions. [2023-12-03 01:05:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-03 01:05:14,463 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:14,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:14,621 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:05:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1008 states and 1178 transitions. [2023-12-03 01:05:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1178 transitions. [2023-12-03 01:05:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-03 01:05:14,746 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-03 01:05:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1011 states and 1182 transitions. [2023-12-03 01:05:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1182 transitions. [2023-12-03 01:05:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-03 01:05:15,264 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:15,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:15,751 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:05:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1104 states and 1297 transitions. [2023-12-03 01:05:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1297 transitions. [2023-12-03 01:05:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-03 01:05:17,660 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:17,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:17,911 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:05:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1106 states and 1300 transitions. [2023-12-03 01:05:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1300 transitions. [2023-12-03 01:05:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-03 01:05:18,262 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:18,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-03 01:05:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1153 states and 1353 transitions. [2023-12-03 01:05:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1353 transitions. [2023-12-03 01:05:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-03 01:05:18,902 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 92 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-03 01:05:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1239 states and 1442 transitions. [2023-12-03 01:05:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1442 transitions. [2023-12-03 01:05:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-03 01:05:19,890 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:20,301 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:05:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1310 states and 1530 transitions. [2023-12-03 01:05:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1530 transitions. [2023-12-03 01:05:21,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-03 01:05:21,945 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:21,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 159 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-03 01:05:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1369 states and 1611 transitions. [2023-12-03 01:05:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1611 transitions. [2023-12-03 01:05:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-03 01:05:24,435 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 159 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-03 01:05:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1385 states and 1631 transitions. [2023-12-03 01:05:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1631 transitions. [2023-12-03 01:05:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-03 01:05:25,800 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 159 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-03 01:05:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1394 states and 1639 transitions. [2023-12-03 01:05:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1639 transitions. [2023-12-03 01:05:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-03 01:05:26,381 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:26,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:05:26,869 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:05:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:05:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1432 states and 1683 transitions. [2023-12-03 01:05:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1683 transitions. [2023-12-03 01:05:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-03 01:05:29,146 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:05:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:05:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:05:29,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 01:05:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:05:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:05:29,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 01:05:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:05:29,470 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 60 iterations. [2023-12-03 01:05:29,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 01:05:29 ImpRootNode [2023-12-03 01:05:29,593 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-03 01:05:29,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-03 01:05:29,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-03 01:05:29,594 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-03 01:05:29,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:04:52" (3/4) ... [2023-12-03 01:05:29,595 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-03 01:05:29,891 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-03 01:05:29,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-03 01:05:29,891 INFO L158 Benchmark]: Toolchain (without parser) took 39592.04ms. Allocated memory was 138.4MB in the beginning and 629.1MB in the end (delta: 490.7MB). Free memory was 109.8MB in the beginning and 246.8MB in the end (delta: -136.9MB). Peak memory consumption was 353.7MB. Max. memory is 16.1GB. [2023-12-03 01:05:29,892 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory was 69.0MB in the beginning and 68.9MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-03 01:05:29,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.75ms. Allocated memory is still 138.4MB. Free memory was 109.7MB in the beginning and 81.6MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-03 01:05:29,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.79ms. Allocated memory is still 138.4MB. Free memory was 81.6MB in the beginning and 75.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-03 01:05:29,893 INFO L158 Benchmark]: Boogie Preprocessor took 111.33ms. Allocated memory is still 138.4MB. Free memory was 75.8MB in the beginning and 71.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-03 01:05:29,893 INFO L158 Benchmark]: RCFGBuilder took 1618.67ms. Allocated memory was 138.4MB in the beginning and 172.0MB in the end (delta: 33.6MB). Free memory was 71.3MB in the beginning and 130.9MB in the end (delta: -59.6MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2023-12-03 01:05:29,894 INFO L158 Benchmark]: CodeCheck took 36939.27ms. Allocated memory was 172.0MB in the beginning and 629.1MB in the end (delta: 457.2MB). Free memory was 130.9MB in the beginning and 267.7MB in the end (delta: -136.8MB). Peak memory consumption was 319.3MB. Max. memory is 16.1GB. [2023-12-03 01:05:29,894 INFO L158 Benchmark]: Witness Printer took 297.48ms. Allocated memory is still 629.1MB. Free memory was 267.7MB in the beginning and 246.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-03 01:05:29,896 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: 36.8s, OverallIterations: 60, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65236 SdHoareTripleChecker+Valid, 181.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64421 mSDsluCounter, 11193 SdHoareTripleChecker+Invalid, 155.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9324 mSDsCounter, 23023 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145742 IncrementalHoareTripleChecker+Invalid, 168765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23023 mSolverCounterUnsat, 1869 mSDtfsCounter, 145742 mSolverCounterSat, 1.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49692 GetRequests, 48072 SyntacticMatches, 1238 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101794 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 7553 NumberOfCodeBlocks, 7553 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 7300 ConstructedInterpolants, 0 QuantifiedInterpolants, 30298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 45 PerfectInterpolantSequences, 3811/4597 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: 426]: 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)=3, 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=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=6, a17=0, a20=0, 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=6, a17=0, a20=0, 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=6, a17=0, a20=0, 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 TRUE (((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)) [L65] a7 = 0 [L66] a20 = 1 [L67] a21 = 1 [L68] a16 = 4 [L69] a17 = 1 [L70] a8 = 13 [L71] return -1; VAL [\old(input)=3, \result=-1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [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))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=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] [L425] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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] [L426] reach_error() VAL [\old(input)=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory was 69.0MB in the beginning and 68.9MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.75ms. Allocated memory is still 138.4MB. Free memory was 109.7MB in the beginning and 81.6MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.79ms. Allocated memory is still 138.4MB. Free memory was 81.6MB in the beginning and 75.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.33ms. Allocated memory is still 138.4MB. Free memory was 75.8MB in the beginning and 71.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1618.67ms. Allocated memory was 138.4MB in the beginning and 172.0MB in the end (delta: 33.6MB). Free memory was 71.3MB in the beginning and 130.9MB in the end (delta: -59.6MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * CodeCheck took 36939.27ms. Allocated memory was 172.0MB in the beginning and 629.1MB in the end (delta: 457.2MB). Free memory was 130.9MB in the beginning and 267.7MB in the end (delta: -136.8MB). Peak memory consumption was 319.3MB. Max. memory is 16.1GB. * Witness Printer took 297.48ms. Allocated memory is still 629.1MB. Free memory was 267.7MB in the beginning and 246.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-03 01:05:29,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45c94003-329f-46c7-a178-c28d3346a196/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