./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.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_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/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_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/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_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/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 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 21:06:38,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 21:06:38,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 21:06:38,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 21:06:38,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 21:06:38,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 21:06:38,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 21:06:38,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 21:06:38,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 21:06:38,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 21:06:38,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 21:06:38,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 21:06:38,877 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 21:06:38,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 21:06:38,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 21:06:38,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 21:06:38,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 21:06:38,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 21:06:38,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 21:06:38,881 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 21:06:38,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 21:06:38,882 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 21:06:38,883 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 21:06:38,883 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 21:06:38,884 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 21:06:38,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 21:06:38,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 21:06:38,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 21:06:38,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 21:06:38,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 21:06:38,887 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 21:06:38,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 21:06:38,887 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 21:06:38,888 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_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/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_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/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 -> 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 [2023-12-02 21:06:39,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 21:06:39,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 21:06:39,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 21:06:39,101 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 21:06:39,102 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 21:06:39,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2023-12-02 21:06:41,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 21:06:42,158 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 21:06:42,158 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2023-12-02 21:06:42,172 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/data/0ae649345/9db3c490630d40e194cef99c08c494aa/FLAG593dc7339 [2023-12-02 21:06:42,192 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/data/0ae649345/9db3c490630d40e194cef99c08c494aa [2023-12-02 21:06:42,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 21:06:42,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 21:06:42,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 21:06:42,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 21:06:42,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 21:06:42,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c518f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42, skipping insertion in model container [2023-12-02 21:06:42,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,248 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 21:06:42,493 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_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2023-12-02 21:06:42,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 21:06:42,543 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 21:06:42,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_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2023-12-02 21:06:42,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 21:06:42,686 INFO L206 MainTranslator]: Completed translation [2023-12-02 21:06:42,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42 WrapperNode [2023-12-02 21:06:42,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 21:06:42,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 21:06:42,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 21:06:42,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 21:06:42,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,755 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2023-12-02 21:06:42,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 21:06:42,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 21:06:42,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 21:06:42,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 21:06:42,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 21:06:42,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 21:06:42,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 21:06:42,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 21:06:42,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:06:42" (1/1) ... [2023-12-02 21:06:42,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 21:06:42,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 21:06:42,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-02 21:06:42,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-02 21:06:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 21:06:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 21:06:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 21:06:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 21:06:42,980 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 21:06:42,983 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 21:06:43,820 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 21:06:44,058 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 21:06:44,059 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 21:06:44,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:06:44 BoogieIcfgContainer [2023-12-02 21:06:44,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 21:06:44,061 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 21:06:44,061 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 21:06:44,071 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 21:06:44,071 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:06:44" (1/1) ... [2023-12-02 21:06:44,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 21:06:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2023-12-02 21:06:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2023-12-02 21:06:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 21:06:44,139 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2023-12-02 21:06:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2023-12-02 21:06:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 21:06:44,933 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:45,049 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-02 21:06:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2023-12-02 21:06:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2023-12-02 21:06:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 21:06:45,241 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:45,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2023-12-02 21:06:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2023-12-02 21:06:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 21:06:45,397 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 21:06:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2023-12-02 21:06:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2023-12-02 21:06:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 21:06:45,604 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:45,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2023-12-02 21:06:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2023-12-02 21:06:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-02 21:06:45,865 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:45,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2023-12-02 21:06:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2023-12-02 21:06:46,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-02 21:06:46,112 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:46,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2023-12-02 21:06:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2023-12-02 21:06:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 21:06:46,367 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:46,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2023-12-02 21:06:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2023-12-02 21:06:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-02 21:06:46,803 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:46,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2023-12-02 21:06:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2023-12-02 21:06:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 21:06:47,293 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2023-12-02 21:06:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2023-12-02 21:06:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 21:06:48,065 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2023-12-02 21:06:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2023-12-02 21:06:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 21:06:48,780 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:48,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2023-12-02 21:06:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2023-12-02 21:06:49,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-02 21:06:49,146 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:49,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2023-12-02 21:06:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2023-12-02 21:06:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 21:06:49,350 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:49,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 21:06:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2023-12-02 21:06:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2023-12-02 21:06:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 21:06:49,667 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2023-12-02 21:06:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2023-12-02 21:06:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 21:06:50,439 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2023-12-02 21:06:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2023-12-02 21:06:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 21:06:50,664 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2023-12-02 21:06:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2023-12-02 21:06:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-02 21:06:51,256 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 21:06:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2023-12-02 21:06:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2023-12-02 21:06:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-02 21:06:52,008 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:52,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2023-12-02 21:06:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2023-12-02 21:06:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-02 21:06:52,139 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 21:06:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2023-12-02 21:06:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2023-12-02 21:06:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 21:06:52,558 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 21:06:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2023-12-02 21:06:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2023-12-02 21:06:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 21:06:53,057 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:53,127 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 21:06:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2023-12-02 21:06:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2023-12-02 21:06:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 21:06:53,467 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:53,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 21:06:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2023-12-02 21:06:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2023-12-02 21:06:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 21:06:53,715 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:53,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2023-12-02 21:06:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2023-12-02 21:06:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-02 21:06:54,146 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:54,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2023-12-02 21:06:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2023-12-02 21:06:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-02 21:06:54,452 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2023-12-02 21:06:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2023-12-02 21:06:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 21:06:54,801 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 21:06:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2023-12-02 21:06:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2023-12-02 21:06:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 21:06:55,102 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:55,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 21:06:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2023-12-02 21:06:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2023-12-02 21:06:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 21:06:55,206 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2023-12-02 21:06:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2023-12-02 21:06:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-02 21:06:55,347 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2023-12-02 21:06:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2023-12-02 21:06:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-02 21:06:55,865 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:55,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2023-12-02 21:06:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2023-12-02 21:06:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 21:06:56,166 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 21:06:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2023-12-02 21:06:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2023-12-02 21:06:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 21:06:56,371 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:56,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2023-12-02 21:06:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2023-12-02 21:06:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 21:06:56,901 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 21:06:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2023-12-02 21:06:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2023-12-02 21:06:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 21:06:57,315 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:57,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 21:06:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2023-12-02 21:06:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2023-12-02 21:06:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 21:06:57,613 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 21:06:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2023-12-02 21:06:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2023-12-02 21:06:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 21:06:57,924 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 21:06:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 477 states and 646 transitions. [2023-12-02 21:06:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 646 transitions. [2023-12-02 21:06:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 21:06:58,487 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 491 states and 662 transitions. [2023-12-02 21:06:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 662 transitions. [2023-12-02 21:06:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 21:06:58,648 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:58,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 502 states and 675 transitions. [2023-12-02 21:06:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 675 transitions. [2023-12-02 21:06:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-02 21:06:58,841 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:58,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 21:06:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 507 states and 682 transitions. [2023-12-02 21:06:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 682 transitions. [2023-12-02 21:06:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 21:06:59,052 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:06:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 509 states and 685 transitions. [2023-12-02 21:06:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 685 transitions. [2023-12-02 21:06:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 21:06:59,187 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 21:06:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 516 states and 693 transitions. [2023-12-02 21:06:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 693 transitions. [2023-12-02 21:06:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 21:06:59,381 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:59,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 21:06:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:06:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 518 states and 694 transitions. [2023-12-02 21:06:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 694 transitions. [2023-12-02 21:06:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 21:06:59,551 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:06:59,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:06:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:06:59,621 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-02 21:07:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 556 states and 738 transitions. [2023-12-02 21:07:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 738 transitions. [2023-12-02 21:07:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 21:07:00,411 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:00,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:00,489 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-02 21:07:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 559 states and 740 transitions. [2023-12-02 21:07:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 740 transitions. [2023-12-02 21:07:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 21:07:00,706 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:00,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:00,787 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-02 21:07:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 562 states and 742 transitions. [2023-12-02 21:07:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 742 transitions. [2023-12-02 21:07:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 21:07:01,011 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:07:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 571 states and 752 transitions. [2023-12-02 21:07:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 752 transitions. [2023-12-02 21:07:01,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-02 21:07:01,138 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 21:07:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 580 states and 760 transitions. [2023-12-02 21:07:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 760 transitions. [2023-12-02 21:07:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-02 21:07:01,253 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-02 21:07:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 669 states and 852 transitions. [2023-12-02 21:07:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 852 transitions. [2023-12-02 21:07:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-02 21:07:02,022 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:02,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:07:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 696 states and 880 transitions. [2023-12-02 21:07:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 880 transitions. [2023-12-02 21:07:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-02 21:07:02,274 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:02,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:07:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 724 states and 909 transitions. [2023-12-02 21:07:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 909 transitions. [2023-12-02 21:07:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-02 21:07:02,755 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-02 21:07:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 725 states and 909 transitions. [2023-12-02 21:07:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 909 transitions. [2023-12-02 21:07:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 21:07:02,865 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:02,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:07:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 797 states and 1003 transitions. [2023-12-02 21:07:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1003 transitions. [2023-12-02 21:07:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 21:07:05,893 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:07:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 801 states and 1008 transitions. [2023-12-02 21:07:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1008 transitions. [2023-12-02 21:07:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 21:07:06,584 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:06,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:07:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 828 states and 1039 transitions. [2023-12-02 21:07:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1039 transitions. [2023-12-02 21:07:07,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-02 21:07:07,074 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:07:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 893 states and 1111 transitions. [2023-12-02 21:07:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1111 transitions. [2023-12-02 21:07:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-02 21:07:08,917 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:07:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 908 states and 1126 transitions. [2023-12-02 21:07:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1126 transitions. [2023-12-02 21:07:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-02 21:07:09,130 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:09,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 21:07:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 911 states and 1129 transitions. [2023-12-02 21:07:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1129 transitions. [2023-12-02 21:07:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-02 21:07:09,458 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 21:07:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 947 states and 1165 transitions. [2023-12-02 21:07:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1165 transitions. [2023-12-02 21:07:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-02 21:07:09,722 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:07:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 124 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 21:07:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:07:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 987 states and 1211 transitions. [2023-12-02 21:07:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1211 transitions. [2023-12-02 21:07:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-02 21:07:11,232 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:07:11,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:07:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 21:07:11,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 21:07:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 21:07:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 21:07:11,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 21:07:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 21:07:11,577 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 61 iterations. [2023-12-02 21:07:11,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 09:07:11 ImpRootNode [2023-12-02 21:07:11,693 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 21:07:11,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 21:07:11,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 21:07:11,694 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 21:07:11,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:06:44" (3/4) ... [2023-12-02 21:07:11,695 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 21:07:11,980 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 21:07:11,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 21:07:11,981 INFO L158 Benchmark]: Toolchain (without parser) took 29785.35ms. Allocated memory was 163.6MB in the beginning and 690.0MB in the end (delta: 526.4MB). Free memory was 113.2MB in the beginning and 477.6MB in the end (delta: -364.4MB). Peak memory consumption was 163.4MB. Max. memory is 16.1GB. [2023-12-02 21:07:11,981 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 21:07:11,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.48ms. Allocated memory was 163.6MB in the beginning and 228.6MB in the end (delta: 65.0MB). Free memory was 112.8MB in the beginning and 195.0MB in the end (delta: -82.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2023-12-02 21:07:11,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.15ms. Allocated memory is still 228.6MB. Free memory was 195.0MB in the beginning and 188.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 21:07:11,982 INFO L158 Benchmark]: Boogie Preprocessor took 68.84ms. Allocated memory is still 228.6MB. Free memory was 188.7MB in the beginning and 184.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 21:07:11,983 INFO L158 Benchmark]: RCFGBuilder took 1234.62ms. Allocated memory is still 228.6MB. Free memory was 184.5MB in the beginning and 173.6MB in the end (delta: 10.9MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. [2023-12-02 21:07:11,983 INFO L158 Benchmark]: CodeCheck took 27632.07ms. Allocated memory was 228.6MB in the beginning and 690.0MB in the end (delta: 461.4MB). Free memory was 173.6MB in the beginning and 496.5MB in the end (delta: -322.9MB). Peak memory consumption was 139.5MB. Max. memory is 16.1GB. [2023-12-02 21:07:11,984 INFO L158 Benchmark]: Witness Printer took 286.20ms. Allocated memory is still 690.0MB. Free memory was 496.5MB in the beginning and 477.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 21:07:11,986 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: 27.5s, OverallIterations: 61, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48342 SdHoareTripleChecker+Valid, 130.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46451 mSDsluCounter, 8904 SdHoareTripleChecker+Invalid, 108.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7378 mSDsCounter, 23330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115377 IncrementalHoareTripleChecker+Invalid, 138707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23330 mSolverCounterUnsat, 1526 mSDtfsCounter, 115377 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48483 GetRequests, 47391 SyntacticMatches, 710 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83763 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 6683 NumberOfCodeBlocks, 6683 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 6448 ConstructedInterpolants, 0 QuantifiedInterpolants, 14943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 60 InterpolantComputations, 53 PerfectInterpolantSequences, 2471/2495 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: 438]: 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 TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\old(input)=1, \result=24, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=24, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [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)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [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)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=2, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L276] a17 = 0 [L277] return 24; VAL [\old(input)=2, \result=24, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=24, 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=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=5, 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=5, 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=5, 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 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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L322] COND TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L323] a8 = 13 [L324] a16 = 4 [L325] return -1; VAL [\old(input)=3, \result=-1, a12=8, a16=4, a17=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L434] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=4, a17=0, a20=0, 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] [L437] 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=0, a20=0, 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] [L438] reach_error() VAL [\old(input)=1, a12=8, a16=4, a17=0, a20=0, 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.17ms. Allocated memory is still 109.1MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.48ms. Allocated memory was 163.6MB in the beginning and 228.6MB in the end (delta: 65.0MB). Free memory was 112.8MB in the beginning and 195.0MB in the end (delta: -82.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.15ms. Allocated memory is still 228.6MB. Free memory was 195.0MB in the beginning and 188.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.84ms. Allocated memory is still 228.6MB. Free memory was 188.7MB in the beginning and 184.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1234.62ms. Allocated memory is still 228.6MB. Free memory was 184.5MB in the beginning and 173.6MB in the end (delta: 10.9MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. * CodeCheck took 27632.07ms. Allocated memory was 228.6MB in the beginning and 690.0MB in the end (delta: 461.4MB). Free memory was 173.6MB in the beginning and 496.5MB in the end (delta: -322.9MB). Peak memory consumption was 139.5MB. Max. memory is 16.1GB. * Witness Printer took 286.20ms. Allocated memory is still 690.0MB. Free memory was 496.5MB in the beginning and 477.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-02 21:07:12,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31ac2b02-6c3c-47a3-ac4d-a3ca3b710205/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