./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem13_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem13_label35.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf2e434ddb1157766f0427b524597e37ed925d60033c6d19795be6a9bcd22934 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:18:39,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:18:39,518 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 14:18:39,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:18:39,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:18:39,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:18:39,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:18:39,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:18:39,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:18:39,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:18:39,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:18:39,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:18:39,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:18:39,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:18:39,549 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:18:39,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:18:39,550 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:18:39,551 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:18:39,551 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:18:39,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:18:39,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:18:39,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:18:39,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:18:39,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:18:39,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:18:39,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:18:39,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:18:39,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:18:39,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:18:39,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:18:39,552 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:18:39,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:18:39,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:18:39,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:18:39,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:18:39,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:18:39,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:18:39,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:18:39,553 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1 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 -> Automizer 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 -> bf2e434ddb1157766f0427b524597e37ed925d60033c6d19795be6a9bcd22934 [2024-12-02 14:18:39,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:18:39,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:18:39,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:18:39,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:18:39,804 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:18:39,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/eca-rers2012/Problem13_label35.c [2024-12-02 14:18:42,577 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/data/1741c237a/70027e4556bb48b7ae69ceaa436662b7/FLAGf2a97a0a7 [2024-12-02 14:18:42,980 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:18:42,981 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/sv-benchmarks/c/eca-rers2012/Problem13_label35.c [2024-12-02 14:18:43,004 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/data/1741c237a/70027e4556bb48b7ae69ceaa436662b7/FLAGf2a97a0a7 [2024-12-02 14:18:43,016 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/data/1741c237a/70027e4556bb48b7ae69ceaa436662b7 [2024-12-02 14:18:43,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:18:43,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:18:43,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:18:43,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:18:43,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:18:43,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:18:43" (1/1) ... [2024-12-02 14:18:43,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438439c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:43, skipping insertion in model container [2024-12-02 14:18:43,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:18:43" (1/1) ... [2024-12-02 14:18:43,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:18:43,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/sv-benchmarks/c/eca-rers2012/Problem13_label35.c[1793,1806] [2024-12-02 14:18:43,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:18:43,936 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:18:43,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/sv-benchmarks/c/eca-rers2012/Problem13_label35.c[1793,1806] [2024-12-02 14:18:44,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:18:44,418 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:18:44,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44 WrapperNode [2024-12-02 14:18:44,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:18:44,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:18:44,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:18:44,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:18:44,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:44,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:44,900 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5586 [2024-12-02 14:18:44,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:18:44,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:18:44,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:18:44,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:18:44,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:44,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:44,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:45,267 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 14:18:45,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:45,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:45,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:45,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:45,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:45,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:45,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:45,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:18:45,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:18:45,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:18:45,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:18:45,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (1/1) ... [2024-12-02 14:18:45,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:18:45,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:18:45,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:18:45,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:18:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:18:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:18:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:18:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:18:45,612 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:18:45,614 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:18:51,767 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-12-02 14:18:51,767 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:18:51,797 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:18:51,797 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 14:18:51,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:51 BoogieIcfgContainer [2024-12-02 14:18:51,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:18:51,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:18:51,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:18:51,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:18:51,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:18:43" (1/3) ... [2024-12-02 14:18:51,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c210e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:18:51, skipping insertion in model container [2024-12-02 14:18:51,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:44" (2/3) ... [2024-12-02 14:18:51,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c210e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:18:51, skipping insertion in model container [2024-12-02 14:18:51,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:51" (3/3) ... [2024-12-02 14:18:51,807 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label35.c [2024-12-02 14:18:51,821 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:18:51,823 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label35.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 14:18:51,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:18:51,909 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@76e78988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:18:51,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 14:18:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:18:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 14:18:51,922 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:18:51,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:18:51,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:18:51,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:18:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1417350502, now seen corresponding path program 1 times [2024-12-02 14:18:51,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:18:51,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865038138] [2024-12-02 14:18:51,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:18:51,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:18:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:18:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:18:52,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:18:52,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865038138] [2024-12-02 14:18:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865038138] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:18:52,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:18:52,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:18:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138455992] [2024-12-02 14:18:52,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:18:52,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:18:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:18:52,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:18:52,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:18:52,122 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:18:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:18:56,535 INFO L93 Difference]: Finished difference Result 3160 states and 5843 transitions. [2024-12-02 14:18:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:18:56,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-12-02 14:18:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:18:56,558 INFO L225 Difference]: With dead ends: 3160 [2024-12-02 14:18:56,558 INFO L226 Difference]: Without dead ends: 1983 [2024-12-02 14:18:56,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:18:56,566 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1093 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:18:56,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 340 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-12-02 14:18:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-12-02 14:18:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2024-12-02 14:18:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:18:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2024-12-02 14:18:56,677 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 10 [2024-12-02 14:18:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:18:56,677 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2024-12-02 14:18:56,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:18:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2024-12-02 14:18:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 14:18:56,679 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:18:56,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:18:56,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:18:56,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:18:56,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:18:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2107929182, now seen corresponding path program 1 times [2024-12-02 14:18:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:18:56,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315985020] [2024-12-02 14:18:56,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:18:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:18:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:18:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:18:56,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:18:56,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315985020] [2024-12-02 14:18:56,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315985020] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:18:56,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:18:56,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:18:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968841910] [2024-12-02 14:18:56,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:18:56,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:18:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:18:56,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:18:56,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:18:56,941 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:00,611 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2024-12-02 14:19:00,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:00,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-12-02 14:19:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:00,621 INFO L225 Difference]: With dead ends: 5456 [2024-12-02 14:19:00,621 INFO L226 Difference]: Without dead ends: 3528 [2024-12-02 14:19:00,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:00,623 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:00,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1007 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-12-02 14:19:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2024-12-02 14:19:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2024-12-02 14:19:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2024-12-02 14:19:00,673 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 75 [2024-12-02 14:19:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:00,673 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2024-12-02 14:19:00,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2024-12-02 14:19:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-12-02 14:19:00,675 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:00,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:00,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:19:00,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -661621005, now seen corresponding path program 1 times [2024-12-02 14:19:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923707287] [2024-12-02 14:19:00,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:19:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923707287] [2024-12-02 14:19:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923707287] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:00,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:19:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170279684] [2024-12-02 14:19:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:00,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:00,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:00,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:00,782 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:04,352 INFO L93 Difference]: Finished difference Result 10232 states and 16097 transitions. [2024-12-02 14:19:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:04,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-12-02 14:19:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:04,367 INFO L225 Difference]: With dead ends: 10232 [2024-12-02 14:19:04,367 INFO L226 Difference]: Without dead ends: 6708 [2024-12-02 14:19:04,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:04,372 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 972 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:04,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 850 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 14:19:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2024-12-02 14:19:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 6700. [2024-12-02 14:19:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2024-12-02 14:19:04,466 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 81 [2024-12-02 14:19:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:04,467 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2024-12-02 14:19:04,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2024-12-02 14:19:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-02 14:19:04,468 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:04,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:04,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:19:04,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:04,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:04,470 INFO L85 PathProgramCache]: Analyzing trace with hash -533752440, now seen corresponding path program 1 times [2024-12-02 14:19:04,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:04,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63957501] [2024-12-02 14:19:04,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:19:04,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:04,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63957501] [2024-12-02 14:19:04,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63957501] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:04,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:04,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:19:04,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144565332] [2024-12-02 14:19:04,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:04,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:04,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:04,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:04,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:04,610 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:08,409 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2024-12-02 14:19:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-12-02 14:19:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:08,427 INFO L225 Difference]: With dead ends: 17443 [2024-12-02 14:19:08,427 INFO L226 Difference]: Without dead ends: 10745 [2024-12-02 14:19:08,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:08,434 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:08,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 965 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-12-02 14:19:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2024-12-02 14:19:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2024-12-02 14:19:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2024-12-02 14:19:08,620 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 111 [2024-12-02 14:19:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:08,621 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2024-12-02 14:19:08,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2024-12-02 14:19:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-02 14:19:08,623 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:08,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:08,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:19:08,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:08,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1357824881, now seen corresponding path program 1 times [2024-12-02 14:19:08,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:08,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821870864] [2024-12-02 14:19:08,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:08,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:19:08,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821870864] [2024-12-02 14:19:08,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821870864] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:08,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:08,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:19:08,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811680179] [2024-12-02 14:19:08,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:08,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:08,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:08,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:08,769 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:12,162 INFO L93 Difference]: Finished difference Result 30031 states and 41242 transitions. [2024-12-02 14:19:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:12,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-12-02 14:19:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:12,194 INFO L225 Difference]: With dead ends: 30031 [2024-12-02 14:19:12,194 INFO L226 Difference]: Without dead ends: 20151 [2024-12-02 14:19:12,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:12,199 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 856 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:12,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1160 Invalid, 3276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-12-02 14:19:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2024-12-02 14:19:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 18550. [2024-12-02 14:19:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18550 states, 18549 states have (on average 1.252466440239366) internal successors, (23232), 18549 states have internal predecessors, (23232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18550 states to 18550 states and 23232 transitions. [2024-12-02 14:19:12,381 INFO L78 Accepts]: Start accepts. Automaton has 18550 states and 23232 transitions. Word has length 121 [2024-12-02 14:19:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:12,382 INFO L471 AbstractCegarLoop]: Abstraction has 18550 states and 23232 transitions. [2024-12-02 14:19:12,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 18550 states and 23232 transitions. [2024-12-02 14:19:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-12-02 14:19:12,383 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:12,383 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:12,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:19:12,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:12,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:12,384 INFO L85 PathProgramCache]: Analyzing trace with hash -955704610, now seen corresponding path program 1 times [2024-12-02 14:19:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:12,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839814773] [2024-12-02 14:19:12,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:12,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:19:12,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:12,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839814773] [2024-12-02 14:19:12,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839814773] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:12,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:12,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:19:12,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695532906] [2024-12-02 14:19:12,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:12,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:12,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:12,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:12,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:12,551 INFO L87 Difference]: Start difference. First operand 18550 states and 23232 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:15,663 INFO L93 Difference]: Finished difference Result 44989 states and 55638 transitions. [2024-12-02 14:19:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:15,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2024-12-02 14:19:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:15,702 INFO L225 Difference]: With dead ends: 44989 [2024-12-02 14:19:15,702 INFO L226 Difference]: Without dead ends: 26441 [2024-12-02 14:19:15,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:15,717 INFO L435 NwaCegarLoop]: 1030 mSDtfsCounter, 730 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:15,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1214 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-12-02 14:19:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26441 states. [2024-12-02 14:19:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26441 to 26434. [2024-12-02 14:19:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26434 states, 26433 states have (on average 1.2007717625695153) internal successors, (31740), 26433 states have internal predecessors, (31740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26434 states to 26434 states and 31740 transitions. [2024-12-02 14:19:16,038 INFO L78 Accepts]: Start accepts. Automaton has 26434 states and 31740 transitions. Word has length 126 [2024-12-02 14:19:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:16,038 INFO L471 AbstractCegarLoop]: Abstraction has 26434 states and 31740 transitions. [2024-12-02 14:19:16,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 26434 states and 31740 transitions. [2024-12-02 14:19:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-02 14:19:16,040 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:16,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:16,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:19:16,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:16,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2104272133, now seen corresponding path program 1 times [2024-12-02 14:19:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:16,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612908014] [2024-12-02 14:19:16,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:16,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:19:16,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:16,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612908014] [2024-12-02 14:19:16,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612908014] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:16,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:16,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:19:16,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313604254] [2024-12-02 14:19:16,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:16,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:16,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:16,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:16,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:16,166 INFO L87 Difference]: Start difference. First operand 26434 states and 31740 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:19,778 INFO L93 Difference]: Finished difference Result 72535 states and 87976 transitions. [2024-12-02 14:19:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:19,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2024-12-02 14:19:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:19,847 INFO L225 Difference]: With dead ends: 72535 [2024-12-02 14:19:19,847 INFO L226 Difference]: Without dead ends: 46103 [2024-12-02 14:19:19,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:19,865 INFO L435 NwaCegarLoop]: 1847 mSDtfsCounter, 840 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:19,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1984 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-12-02 14:19:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46103 states. [2024-12-02 14:19:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46103 to 42946. [2024-12-02 14:19:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42946 states, 42945 states have (on average 1.17205728257073) internal successors, (50334), 42945 states have internal predecessors, (50334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42946 states to 42946 states and 50334 transitions. [2024-12-02 14:19:20,329 INFO L78 Accepts]: Start accepts. Automaton has 42946 states and 50334 transitions. Word has length 224 [2024-12-02 14:19:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:20,330 INFO L471 AbstractCegarLoop]: Abstraction has 42946 states and 50334 transitions. [2024-12-02 14:19:20,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 42946 states and 50334 transitions. [2024-12-02 14:19:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-12-02 14:19:20,333 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:20,334 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:20,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:19:20,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:20,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2051912356, now seen corresponding path program 1 times [2024-12-02 14:19:20,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:20,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424317478] [2024-12-02 14:19:20,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 14:19:20,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:20,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424317478] [2024-12-02 14:19:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424317478] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:20,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:20,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:19:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736951421] [2024-12-02 14:19:20,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:20,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:20,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:20,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:20,750 INFO L87 Difference]: Start difference. First operand 42946 states and 50334 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:23,719 INFO L93 Difference]: Finished difference Result 85103 states and 99869 transitions. [2024-12-02 14:19:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:23,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2024-12-02 14:19:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:23,753 INFO L225 Difference]: With dead ends: 85103 [2024-12-02 14:19:23,753 INFO L226 Difference]: Without dead ends: 42946 [2024-12-02 14:19:23,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:23,773 INFO L435 NwaCegarLoop]: 1064 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2501 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:23,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1193 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2501 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-12-02 14:19:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42946 states. [2024-12-02 14:19:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42946 to 42946. [2024-12-02 14:19:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42946 states, 42945 states have (on average 1.1719408545814414) internal successors, (50329), 42945 states have internal predecessors, (50329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42946 states to 42946 states and 50329 transitions. [2024-12-02 14:19:24,198 INFO L78 Accepts]: Start accepts. Automaton has 42946 states and 50329 transitions. Word has length 230 [2024-12-02 14:19:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:24,198 INFO L471 AbstractCegarLoop]: Abstraction has 42946 states and 50329 transitions. [2024-12-02 14:19:24,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 42946 states and 50329 transitions. [2024-12-02 14:19:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-02 14:19:24,202 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:24,202 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:24,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:19:24,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:24,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash 559254191, now seen corresponding path program 1 times [2024-12-02 14:19:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:24,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750858561] [2024-12-02 14:19:24,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:19:24,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:24,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750858561] [2024-12-02 14:19:24,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750858561] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:24,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:24,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:19:24,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650900792] [2024-12-02 14:19:24,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:24,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:24,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:24,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:24,415 INFO L87 Difference]: Start difference. First operand 42946 states and 50329 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:28,231 INFO L93 Difference]: Finished difference Result 104790 states and 124853 transitions. [2024-12-02 14:19:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:28,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2024-12-02 14:19:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:28,285 INFO L225 Difference]: With dead ends: 104790 [2024-12-02 14:19:28,285 INFO L226 Difference]: Without dead ends: 62633 [2024-12-02 14:19:28,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:28,303 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 823 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:28,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 930 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 14:19:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62633 states. [2024-12-02 14:19:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62633 to 60261. [2024-12-02 14:19:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60261 states, 60260 states have (on average 1.1628609359442417) internal successors, (70074), 60260 states have internal predecessors, (70074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60261 states to 60261 states and 70074 transitions. [2024-12-02 14:19:28,854 INFO L78 Accepts]: Start accepts. Automaton has 60261 states and 70074 transitions. Word has length 237 [2024-12-02 14:19:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:28,855 INFO L471 AbstractCegarLoop]: Abstraction has 60261 states and 70074 transitions. [2024-12-02 14:19:28,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 60261 states and 70074 transitions. [2024-12-02 14:19:28,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-12-02 14:19:28,860 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:28,861 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:28,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 14:19:28,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:28,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1758434701, now seen corresponding path program 1 times [2024-12-02 14:19:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993309668] [2024-12-02 14:19:28,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 147 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 14:19:29,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993309668] [2024-12-02 14:19:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993309668] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:19:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532111594] [2024-12-02 14:19:29,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:29,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:19:29,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:19:29,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:19:29,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:19:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:30,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 14:19:30,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:19:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-02 14:19:30,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:19:30,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532111594] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:30,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:19:30,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-12-02 14:19:30,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762234826] [2024-12-02 14:19:30,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:30,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:30,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:30,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:30,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:19:30,179 INFO L87 Difference]: Start difference. First operand 60261 states and 70074 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:33,332 INFO L93 Difference]: Finished difference Result 119722 states and 139344 transitions. [2024-12-02 14:19:33,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:33,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2024-12-02 14:19:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:33,381 INFO L225 Difference]: With dead ends: 119722 [2024-12-02 14:19:33,381 INFO L226 Difference]: Without dead ends: 60250 [2024-12-02 14:19:33,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:19:33,408 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1075 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:33,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 821 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-12-02 14:19:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60250 states. [2024-12-02 14:19:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60250 to 60247. [2024-12-02 14:19:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60247 states, 60246 states have (on average 1.1198917770474388) internal successors, (67469), 60246 states have internal predecessors, (67469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60247 states to 60247 states and 67469 transitions. [2024-12-02 14:19:33,942 INFO L78 Accepts]: Start accepts. Automaton has 60247 states and 67469 transitions. Word has length 316 [2024-12-02 14:19:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:33,942 INFO L471 AbstractCegarLoop]: Abstraction has 60247 states and 67469 transitions. [2024-12-02 14:19:33,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 60247 states and 67469 transitions. [2024-12-02 14:19:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-12-02 14:19:33,944 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:33,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:33,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:19:34,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:19:34,145 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:34,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash -949171357, now seen corresponding path program 1 times [2024-12-02 14:19:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996603385] [2024-12-02 14:19:34,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-12-02 14:19:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996603385] [2024-12-02 14:19:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996603385] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:34,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:34,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:19:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512748148] [2024-12-02 14:19:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:34,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:34,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:34,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:34,331 INFO L87 Difference]: Start difference. First operand 60247 states and 67469 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:38,173 INFO L93 Difference]: Finished difference Result 131500 states and 148742 transitions. [2024-12-02 14:19:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:38,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2024-12-02 14:19:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:38,337 INFO L225 Difference]: With dead ends: 131500 [2024-12-02 14:19:38,337 INFO L226 Difference]: Without dead ends: 72042 [2024-12-02 14:19:38,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:38,351 INFO L435 NwaCegarLoop]: 1438 mSDtfsCounter, 1145 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 3159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:38,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 1522 Invalid, 3159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 14:19:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72042 states. [2024-12-02 14:19:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72042 to 72041. [2024-12-02 14:19:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72041 states, 72040 states have (on average 1.1067323709050527) internal successors, (79729), 72040 states have internal predecessors, (79729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72041 states to 72041 states and 79729 transitions. [2024-12-02 14:19:38,847 INFO L78 Accepts]: Start accepts. Automaton has 72041 states and 79729 transitions. Word has length 325 [2024-12-02 14:19:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:38,847 INFO L471 AbstractCegarLoop]: Abstraction has 72041 states and 79729 transitions. [2024-12-02 14:19:38,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 72041 states and 79729 transitions. [2024-12-02 14:19:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-12-02 14:19:38,850 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:38,850 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:38,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:19:38,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:38,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 240805553, now seen corresponding path program 1 times [2024-12-02 14:19:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918350081] [2024-12-02 14:19:38,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-12-02 14:19:39,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:39,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918350081] [2024-12-02 14:19:39,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918350081] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:39,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:39,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:19:39,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190293570] [2024-12-02 14:19:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:39,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:19:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:39,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:19:39,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:19:39,030 INFO L87 Difference]: Start difference. First operand 72041 states and 79729 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:45,602 INFO L93 Difference]: Finished difference Result 181243 states and 200566 transitions. [2024-12-02 14:19:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:19:45,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2024-12-02 14:19:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:45,694 INFO L225 Difference]: With dead ends: 181243 [2024-12-02 14:19:45,694 INFO L226 Difference]: Without dead ends: 109991 [2024-12-02 14:19:45,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:19:45,725 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1687 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 5916 mSolverCounterSat, 996 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 6912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 996 IncrementalHoareTripleChecker+Valid, 5916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:45,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 837 Invalid, 6912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [996 Valid, 5916 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-12-02 14:19:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109991 states. [2024-12-02 14:19:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109991 to 87793. [2024-12-02 14:19:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87793 states, 87792 states have (on average 1.0966375068343357) internal successors, (96276), 87792 states have internal predecessors, (96276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87793 states to 87793 states and 96276 transitions. [2024-12-02 14:19:46,543 INFO L78 Accepts]: Start accepts. Automaton has 87793 states and 96276 transitions. Word has length 358 [2024-12-02 14:19:46,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:46,543 INFO L471 AbstractCegarLoop]: Abstraction has 87793 states and 96276 transitions. [2024-12-02 14:19:46,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 87793 states and 96276 transitions. [2024-12-02 14:19:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-12-02 14:19:46,546 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:46,546 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:46,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 14:19:46,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:46,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1615939699, now seen corresponding path program 1 times [2024-12-02 14:19:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969681330] [2024-12-02 14:19:46,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-02 14:19:46,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:46,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969681330] [2024-12-02 14:19:46,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969681330] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:46,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:19:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858065525] [2024-12-02 14:19:46,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:46,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:46,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:46,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:46,703 INFO L87 Difference]: Start difference. First operand 87793 states and 96276 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:50,403 INFO L93 Difference]: Finished difference Result 199191 states and 219080 transitions. [2024-12-02 14:19:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:50,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 371 [2024-12-02 14:19:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:50,494 INFO L225 Difference]: With dead ends: 199191 [2024-12-02 14:19:50,494 INFO L226 Difference]: Without dead ends: 112187 [2024-12-02 14:19:50,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:50,529 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 815 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 3312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:50,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 835 Invalid, 3312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-12-02 14:19:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112187 states. [2024-12-02 14:19:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112187 to 110599. [2024-12-02 14:19:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110599 states, 110598 states have (on average 1.0884554874410026) internal successors, (120381), 110598 states have internal predecessors, (120381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110599 states to 110599 states and 120381 transitions. [2024-12-02 14:19:51,479 INFO L78 Accepts]: Start accepts. Automaton has 110599 states and 120381 transitions. Word has length 371 [2024-12-02 14:19:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:51,480 INFO L471 AbstractCegarLoop]: Abstraction has 110599 states and 120381 transitions. [2024-12-02 14:19:51,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 110599 states and 120381 transitions. [2024-12-02 14:19:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2024-12-02 14:19:51,486 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:51,487 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:51,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 14:19:51,487 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:51,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash -459150642, now seen corresponding path program 1 times [2024-12-02 14:19:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:51,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157442667] [2024-12-02 14:19:51,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:51,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-12-02 14:19:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:51,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157442667] [2024-12-02 14:19:51,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157442667] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:19:51,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:19:51,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:19:51,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621868246] [2024-12-02 14:19:51,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:19:51,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:19:51,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:19:51,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:19:51,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:51,937 INFO L87 Difference]: Start difference. First operand 110599 states and 120381 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:19:56,207 INFO L93 Difference]: Finished difference Result 244017 states and 266527 transitions. [2024-12-02 14:19:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:19:56,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 477 [2024-12-02 14:19:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:19:56,323 INFO L225 Difference]: With dead ends: 244017 [2024-12-02 14:19:56,323 INFO L226 Difference]: Without dead ends: 132633 [2024-12-02 14:19:56,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:19:56,361 INFO L435 NwaCegarLoop]: 1707 mSDtfsCounter, 849 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:19:56,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1842 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 2490 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 14:19:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132633 states. [2024-12-02 14:19:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132633 to 132620. [2024-12-02 14:19:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132620 states, 132619 states have (on average 1.0746650178330406) internal successors, (142521), 132619 states have internal predecessors, (142521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132620 states to 132620 states and 142521 transitions. [2024-12-02 14:19:57,474 INFO L78 Accepts]: Start accepts. Automaton has 132620 states and 142521 transitions. Word has length 477 [2024-12-02 14:19:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:19:57,474 INFO L471 AbstractCegarLoop]: Abstraction has 132620 states and 142521 transitions. [2024-12-02 14:19:57,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:19:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 132620 states and 142521 transitions. [2024-12-02 14:19:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-12-02 14:19:57,486 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:19:57,487 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:19:57,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 14:19:57,487 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:19:57,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:19:57,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1561614142, now seen corresponding path program 1 times [2024-12-02 14:19:57,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:19:57,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955819909] [2024-12-02 14:19:57,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:57,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:19:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 253 proven. 113 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 14:19:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:19:59,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955819909] [2024-12-02 14:19:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955819909] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:19:59,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606835369] [2024-12-02 14:19:59,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:19:59,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:19:59,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:19:59,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:19:59,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:19:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:19:59,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 14:19:59,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:20:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-12-02 14:20:00,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:20:00,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606835369] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:20:00,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:20:00,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-12-02 14:20:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423173948] [2024-12-02 14:20:00,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:20:00,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:20:00,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:20:00,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:20:00,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:20:00,330 INFO L87 Difference]: Start difference. First operand 132620 states and 142521 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 2 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:20:03,394 INFO L93 Difference]: Finished difference Result 251079 states and 270447 transitions. [2024-12-02 14:20:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:20:03,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 2 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 593 [2024-12-02 14:20:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:20:03,513 INFO L225 Difference]: With dead ends: 251079 [2024-12-02 14:20:03,513 INFO L226 Difference]: Without dead ends: 135779 [2024-12-02 14:20:03,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:20:03,564 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 680 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 2532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:20:03,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1115 Invalid, 2532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2425 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-12-02 14:20:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135779 states. [2024-12-02 14:20:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135779 to 135769. [2024-12-02 14:20:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135769 states, 135768 states have (on average 1.0669450827882858) internal successors, (144857), 135768 states have internal predecessors, (144857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135769 states to 135769 states and 144857 transitions. [2024-12-02 14:20:04,900 INFO L78 Accepts]: Start accepts. Automaton has 135769 states and 144857 transitions. Word has length 593 [2024-12-02 14:20:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:20:04,900 INFO L471 AbstractCegarLoop]: Abstraction has 135769 states and 144857 transitions. [2024-12-02 14:20:04,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 2 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 135769 states and 144857 transitions. [2024-12-02 14:20:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2024-12-02 14:20:04,913 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:20:04,913 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:20:04,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 14:20:05,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-12-02 14:20:05,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:20:05,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:20:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash -698546600, now seen corresponding path program 1 times [2024-12-02 14:20:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:20:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398312618] [2024-12-02 14:20:05,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:20:05,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:20:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:20:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 743 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-12-02 14:20:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:20:05,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398312618] [2024-12-02 14:20:05,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398312618] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:20:05,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:20:05,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:20:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320273759] [2024-12-02 14:20:05,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:20:05,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:20:05,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:20:05,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:20:05,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:05,530 INFO L87 Difference]: Start difference. First operand 135769 states and 144857 transitions. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:20:09,990 INFO L93 Difference]: Finished difference Result 272326 states and 290511 transitions. [2024-12-02 14:20:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:20:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 635 [2024-12-02 14:20:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:20:10,113 INFO L225 Difference]: With dead ends: 272326 [2024-12-02 14:20:10,113 INFO L226 Difference]: Without dead ends: 137346 [2024-12-02 14:20:10,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:10,176 INFO L435 NwaCegarLoop]: 1328 mSDtfsCounter, 919 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:20:10,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 1405 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2365 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-12-02 14:20:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137346 states. [2024-12-02 14:20:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137346 to 135759. [2024-12-02 14:20:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135759 states, 135758 states have (on average 1.0514371160447267) internal successors, (142741), 135758 states have internal predecessors, (142741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135759 states to 135759 states and 142741 transitions. [2024-12-02 14:20:11,407 INFO L78 Accepts]: Start accepts. Automaton has 135759 states and 142741 transitions. Word has length 635 [2024-12-02 14:20:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:20:11,408 INFO L471 AbstractCegarLoop]: Abstraction has 135759 states and 142741 transitions. [2024-12-02 14:20:11,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 135759 states and 142741 transitions. [2024-12-02 14:20:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2024-12-02 14:20:11,426 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:20:11,426 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:20:11,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 14:20:11,426 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:20:11,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:20:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash 521450405, now seen corresponding path program 1 times [2024-12-02 14:20:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:20:11,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915873447] [2024-12-02 14:20:11,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:20:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:20:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:20:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 441 proven. 0 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2024-12-02 14:20:11,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:20:11,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915873447] [2024-12-02 14:20:11,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915873447] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:20:11,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:20:11,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:20:11,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697289921] [2024-12-02 14:20:11,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:20:11,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:20:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:20:11,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:20:11,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:11,696 INFO L87 Difference]: Start difference. First operand 135759 states and 142741 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 2 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:13,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:20:13,921 INFO L93 Difference]: Finished difference Result 251818 states and 265273 transitions. [2024-12-02 14:20:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:20:13,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 2 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 676 [2024-12-02 14:20:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:20:14,025 INFO L225 Difference]: With dead ends: 251818 [2024-12-02 14:20:14,025 INFO L226 Difference]: Without dead ends: 134956 [2024-12-02 14:20:14,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:14,056 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 1564 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-12-02 14:20:14,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 270 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-12-02 14:20:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134956 states. [2024-12-02 14:20:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134956 to 134955. [2024-12-02 14:20:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134955 states, 134954 states have (on average 1.0507358062747307) internal successors, (141801), 134954 states have internal predecessors, (141801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134955 states to 134955 states and 141801 transitions. [2024-12-02 14:20:15,136 INFO L78 Accepts]: Start accepts. Automaton has 134955 states and 141801 transitions. Word has length 676 [2024-12-02 14:20:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:20:15,137 INFO L471 AbstractCegarLoop]: Abstraction has 134955 states and 141801 transitions. [2024-12-02 14:20:15,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 2 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 134955 states and 141801 transitions. [2024-12-02 14:20:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2024-12-02 14:20:15,156 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:20:15,156 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:20:15,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 14:20:15,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:20:15,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:20:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash -464308242, now seen corresponding path program 1 times [2024-12-02 14:20:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:20:15,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469144986] [2024-12-02 14:20:15,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:20:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:20:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:20:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2024-12-02 14:20:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:20:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469144986] [2024-12-02 14:20:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469144986] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:20:16,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:20:16,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:20:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834856445] [2024-12-02 14:20:16,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:20:16,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:20:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:20:16,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:20:16,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:16,517 INFO L87 Difference]: Start difference. First operand 134955 states and 141801 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:20:19,785 INFO L93 Difference]: Finished difference Result 269126 states and 282809 transitions. [2024-12-02 14:20:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:20:19,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 681 [2024-12-02 14:20:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:20:19,895 INFO L225 Difference]: With dead ends: 269126 [2024-12-02 14:20:19,895 INFO L226 Difference]: Without dead ends: 134960 [2024-12-02 14:20:19,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:19,947 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 616 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:20:19,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1731 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-12-02 14:20:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134960 states. [2024-12-02 14:20:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134960 to 132592. [2024-12-02 14:20:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132592 states, 132591 states have (on average 1.042951633217941) internal successors, (138286), 132591 states have internal predecessors, (138286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132592 states to 132592 states and 138286 transitions. [2024-12-02 14:20:21,114 INFO L78 Accepts]: Start accepts. Automaton has 132592 states and 138286 transitions. Word has length 681 [2024-12-02 14:20:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:20:21,115 INFO L471 AbstractCegarLoop]: Abstraction has 132592 states and 138286 transitions. [2024-12-02 14:20:21,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 132592 states and 138286 transitions. [2024-12-02 14:20:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2024-12-02 14:20:21,128 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:20:21,128 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:20:21,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 14:20:21,129 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:20:21,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:20:21,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2070978386, now seen corresponding path program 1 times [2024-12-02 14:20:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:20:21,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683078023] [2024-12-02 14:20:21,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:20:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:20:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:20:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-12-02 14:20:21,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:20:21,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683078023] [2024-12-02 14:20:21,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683078023] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:20:21,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:20:21,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:20:21,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371067161] [2024-12-02 14:20:21,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:20:21,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:20:21,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:20:21,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:20:21,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:21,948 INFO L87 Difference]: Start difference. First operand 132592 states and 138286 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:20:26,195 INFO L93 Difference]: Finished difference Result 270743 states and 282694 transitions. [2024-12-02 14:20:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:20:26,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 690 [2024-12-02 14:20:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:20:26,307 INFO L225 Difference]: With dead ends: 270743 [2024-12-02 14:20:26,307 INFO L226 Difference]: Without dead ends: 154687 [2024-12-02 14:20:26,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:26,347 INFO L435 NwaCegarLoop]: 1467 mSDtfsCounter, 647 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-12-02 14:20:26,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1568 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 2706 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-12-02 14:20:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154687 states. [2024-12-02 14:20:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154687 to 142048. [2024-12-02 14:20:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142048 states, 142047 states have (on average 1.0425211373700254) internal successors, (148087), 142047 states have internal predecessors, (148087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142048 states to 142048 states and 148087 transitions. [2024-12-02 14:20:27,495 INFO L78 Accepts]: Start accepts. Automaton has 142048 states and 148087 transitions. Word has length 690 [2024-12-02 14:20:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:20:27,495 INFO L471 AbstractCegarLoop]: Abstraction has 142048 states and 148087 transitions. [2024-12-02 14:20:27,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 142048 states and 148087 transitions. [2024-12-02 14:20:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2024-12-02 14:20:27,517 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:20:27,517 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:20:27,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 14:20:27,517 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:20:27,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:20:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2125374140, now seen corresponding path program 1 times [2024-12-02 14:20:27,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:20:27,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045297165] [2024-12-02 14:20:27,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:20:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:20:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:20:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-12-02 14:20:28,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:20:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045297165] [2024-12-02 14:20:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045297165] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:20:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:20:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:20:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320500556] [2024-12-02 14:20:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:20:28,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:20:28,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:20:28,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:20:28,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:28,297 INFO L87 Difference]: Start difference. First operand 142048 states and 148087 transitions. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:20:31,336 INFO L93 Difference]: Finished difference Result 269151 states and 280995 transitions. [2024-12-02 14:20:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:20:31,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 726 [2024-12-02 14:20:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:20:31,438 INFO L225 Difference]: With dead ends: 269151 [2024-12-02 14:20:31,438 INFO L226 Difference]: Without dead ends: 142060 [2024-12-02 14:20:31,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:31,473 INFO L435 NwaCegarLoop]: 1568 mSDtfsCounter, 770 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2401 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-12-02 14:20:31,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1695 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2401 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-12-02 14:20:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142060 states. [2024-12-02 14:20:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142060 to 142044. [2024-12-02 14:20:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142044 states, 142043 states have (on average 1.0393331596769992) internal successors, (147630), 142043 states have internal predecessors, (147630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142044 states to 142044 states and 147630 transitions. [2024-12-02 14:20:32,646 INFO L78 Accepts]: Start accepts. Automaton has 142044 states and 147630 transitions. Word has length 726 [2024-12-02 14:20:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:20:32,646 INFO L471 AbstractCegarLoop]: Abstraction has 142044 states and 147630 transitions. [2024-12-02 14:20:32,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 142044 states and 147630 transitions. [2024-12-02 14:20:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2024-12-02 14:20:32,659 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:20:32,660 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:20:32,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 14:20:32,660 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:20:32,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:20:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash 987578991, now seen corresponding path program 1 times [2024-12-02 14:20:32,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:20:32,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432471840] [2024-12-02 14:20:32,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:20:32,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:20:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:20:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-12-02 14:20:33,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:20:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432471840] [2024-12-02 14:20:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432471840] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:20:33,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:20:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:20:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954766230] [2024-12-02 14:20:33,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:20:33,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:20:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:20:33,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:20:33,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:33,209 INFO L87 Difference]: Start difference. First operand 142044 states and 147630 transitions. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:20:37,739 INFO L93 Difference]: Finished difference Result 338502 states and 352063 transitions. [2024-12-02 14:20:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:20:37,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 740 [2024-12-02 14:20:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:20:37,928 INFO L225 Difference]: With dead ends: 338502 [2024-12-02 14:20:37,928 INFO L226 Difference]: Without dead ends: 197247 [2024-12-02 14:20:37,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:37,993 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 810 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2837 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-12-02 14:20:37,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 795 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2837 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-12-02 14:20:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197247 states. [2024-12-02 14:20:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197247 to 168816. [2024-12-02 14:20:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168816 states, 168815 states have (on average 1.0380061013535526) internal successors, (175231), 168815 states have internal predecessors, (175231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168816 states to 168816 states and 175231 transitions. [2024-12-02 14:20:39,891 INFO L78 Accepts]: Start accepts. Automaton has 168816 states and 175231 transitions. Word has length 740 [2024-12-02 14:20:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:20:39,891 INFO L471 AbstractCegarLoop]: Abstraction has 168816 states and 175231 transitions. [2024-12-02 14:20:39,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 168816 states and 175231 transitions. [2024-12-02 14:20:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2024-12-02 14:20:39,903 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:20:39,903 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:20:39,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 14:20:39,904 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:20:39,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:20:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash -73012617, now seen corresponding path program 1 times [2024-12-02 14:20:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:20:39,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192037855] [2024-12-02 14:20:39,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:20:39,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:20:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:20:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-12-02 14:20:40,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:20:40,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192037855] [2024-12-02 14:20:40,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192037855] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:20:40,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:20:40,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:20:40,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630933492] [2024-12-02 14:20:40,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:20:40,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:20:40,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:20:40,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:20:40,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:40,379 INFO L87 Difference]: Start difference. First operand 168816 states and 175231 transitions. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:20:44,187 INFO L93 Difference]: Finished difference Result 374632 states and 389959 transitions. [2024-12-02 14:20:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:20:44,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 749 [2024-12-02 14:20:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:20:44,390 INFO L225 Difference]: With dead ends: 374632 [2024-12-02 14:20:44,390 INFO L226 Difference]: Without dead ends: 223138 [2024-12-02 14:20:44,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:44,457 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 726 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 3133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:20:44,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 566 Invalid, 3133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-12-02 14:20:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223138 states. [2024-12-02 14:20:46,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223138 to 214470. [2024-12-02 14:20:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214470 states, 214469 states have (on average 1.0393017172644998) internal successors, (222898), 214469 states have internal predecessors, (222898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214470 states to 214470 states and 222898 transitions. [2024-12-02 14:20:46,506 INFO L78 Accepts]: Start accepts. Automaton has 214470 states and 222898 transitions. Word has length 749 [2024-12-02 14:20:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:20:46,506 INFO L471 AbstractCegarLoop]: Abstraction has 214470 states and 222898 transitions. [2024-12-02 14:20:46,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 214470 states and 222898 transitions. [2024-12-02 14:20:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2024-12-02 14:20:46,527 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:20:46,527 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:20:46,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 14:20:46,527 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:20:46,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:20:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash 327637615, now seen corresponding path program 1 times [2024-12-02 14:20:46,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:20:46,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120602245] [2024-12-02 14:20:46,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:20:46,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:20:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:20:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2024-12-02 14:20:47,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:20:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120602245] [2024-12-02 14:20:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120602245] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:20:47,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:20:47,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:20:47,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536911187] [2024-12-02 14:20:47,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:20:47,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:20:47,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:20:47,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:20:47,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:47,487 INFO L87 Difference]: Start difference. First operand 214470 states and 222898 transitions. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:20:51,208 INFO L93 Difference]: Finished difference Result 425799 states and 442529 transitions. [2024-12-02 14:20:51,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:20:51,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 804 [2024-12-02 14:20:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:20:51,403 INFO L225 Difference]: With dead ends: 425799 [2024-12-02 14:20:51,403 INFO L226 Difference]: Without dead ends: 210543 [2024-12-02 14:20:51,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:51,466 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 750 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:20:51,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1681 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-12-02 14:20:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210543 states. [2024-12-02 14:20:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210543 to 205787. [2024-12-02 14:20:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205787 states, 205786 states have (on average 1.03370977617525) internal successors, (212723), 205786 states have internal predecessors, (212723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205787 states to 205787 states and 212723 transitions. [2024-12-02 14:20:53,301 INFO L78 Accepts]: Start accepts. Automaton has 205787 states and 212723 transitions. Word has length 804 [2024-12-02 14:20:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:20:53,301 INFO L471 AbstractCegarLoop]: Abstraction has 205787 states and 212723 transitions. [2024-12-02 14:20:53,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 205787 states and 212723 transitions. [2024-12-02 14:20:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2024-12-02 14:20:53,327 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:20:53,327 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:20:53,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 14:20:53,327 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:20:53,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:20:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1882060433, now seen corresponding path program 1 times [2024-12-02 14:20:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:20:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151385672] [2024-12-02 14:20:53,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:20:53,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:20:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:20:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 632 proven. 0 refuted. 0 times theorem prover too weak. 1189 trivial. 0 not checked. [2024-12-02 14:20:53,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:20:53,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151385672] [2024-12-02 14:20:53,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151385672] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:20:53,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:20:53,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:20:53,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54713864] [2024-12-02 14:20:53,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:20:53,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:20:53,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:20:53,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:20:53,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:53,892 INFO L87 Difference]: Start difference. First operand 205787 states and 212723 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:20:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:20:58,331 INFO L93 Difference]: Finished difference Result 439113 states and 454269 transitions. [2024-12-02 14:20:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:20:58,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 841 [2024-12-02 14:20:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:20:58,583 INFO L225 Difference]: With dead ends: 439113 [2024-12-02 14:20:58,583 INFO L226 Difference]: Without dead ends: 250646 [2024-12-02 14:20:58,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:20:58,878 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 736 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:20:58,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 492 Invalid, 3123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-12-02 14:20:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250646 states. [2024-12-02 14:21:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250646 to 190034. [2024-12-02 14:21:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190034 states, 190033 states have (on average 1.0307893892113476) internal successors, (195884), 190033 states have internal predecessors, (195884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190034 states to 190034 states and 195884 transitions. [2024-12-02 14:21:00,710 INFO L78 Accepts]: Start accepts. Automaton has 190034 states and 195884 transitions. Word has length 841 [2024-12-02 14:21:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:21:00,711 INFO L471 AbstractCegarLoop]: Abstraction has 190034 states and 195884 transitions. [2024-12-02 14:21:00,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 190034 states and 195884 transitions. [2024-12-02 14:21:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2024-12-02 14:21:00,734 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:21:00,734 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:21:00,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 14:21:00,734 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:21:00,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:21:00,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1362869771, now seen corresponding path program 1 times [2024-12-02 14:21:00,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:21:00,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264966231] [2024-12-02 14:21:00,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:21:00,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:21:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:21:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 941 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2024-12-02 14:21:01,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:21:01,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264966231] [2024-12-02 14:21:01,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264966231] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:21:01,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:21:01,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:21:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053344743] [2024-12-02 14:21:01,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:21:01,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:21:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:21:01,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:21:01,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:21:01,712 INFO L87 Difference]: Start difference. First operand 190034 states and 195884 transitions. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:21:05,077 INFO L93 Difference]: Finished difference Result 369063 states and 380742 transitions. [2024-12-02 14:21:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:21:05,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 875 [2024-12-02 14:21:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:21:05,237 INFO L225 Difference]: With dead ends: 369063 [2024-12-02 14:21:05,237 INFO L226 Difference]: Without dead ends: 194775 [2024-12-02 14:21:05,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:21:05,307 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 697 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:21:05,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1753 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-12-02 14:21:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194775 states. [2024-12-02 14:21:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194775 to 194756. [2024-12-02 14:21:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194756 states, 194755 states have (on average 1.030371492387872) internal successors, (200670), 194755 states have internal predecessors, (200670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194756 states to 194756 states and 200670 transitions. [2024-12-02 14:21:07,106 INFO L78 Accepts]: Start accepts. Automaton has 194756 states and 200670 transitions. Word has length 875 [2024-12-02 14:21:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:21:07,106 INFO L471 AbstractCegarLoop]: Abstraction has 194756 states and 200670 transitions. [2024-12-02 14:21:07,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 194756 states and 200670 transitions. [2024-12-02 14:21:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2024-12-02 14:21:07,133 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:21:07,133 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:21:07,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 14:21:07,133 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:21:07,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:21:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash 340889389, now seen corresponding path program 1 times [2024-12-02 14:21:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:21:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060531008] [2024-12-02 14:21:07,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:21:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:21:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:21:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1766 backedges. 1190 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-12-02 14:21:08,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:21:08,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060531008] [2024-12-02 14:21:08,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060531008] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:21:08,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:21:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:21:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95596413] [2024-12-02 14:21:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:21:08,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:21:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:21:08,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:21:08,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:21:08,257 INFO L87 Difference]: Start difference. First operand 194756 states and 200670 transitions. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:21:11,739 INFO L93 Difference]: Finished difference Result 376133 states and 387870 transitions. [2024-12-02 14:21:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:21:11,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 899 [2024-12-02 14:21:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:21:11,931 INFO L225 Difference]: With dead ends: 376133 [2024-12-02 14:21:11,931 INFO L226 Difference]: Without dead ends: 197123 [2024-12-02 14:21:12,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:21:12,008 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 722 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-12-02 14:21:12,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1762 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-12-02 14:21:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197123 states. [2024-12-02 14:21:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197123 to 197117. [2024-12-02 14:21:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197117 states, 197116 states have (on average 1.0300026380405447) internal successors, (203030), 197116 states have internal predecessors, (203030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197117 states to 197117 states and 203030 transitions. [2024-12-02 14:21:13,973 INFO L78 Accepts]: Start accepts. Automaton has 197117 states and 203030 transitions. Word has length 899 [2024-12-02 14:21:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:21:13,973 INFO L471 AbstractCegarLoop]: Abstraction has 197117 states and 203030 transitions. [2024-12-02 14:21:13,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 197117 states and 203030 transitions. [2024-12-02 14:21:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 930 [2024-12-02 14:21:14,003 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:21:14,004 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:21:14,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 14:21:14,004 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:21:14,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:21:14,005 INFO L85 PathProgramCache]: Analyzing trace with hash 757926102, now seen corresponding path program 1 times [2024-12-02 14:21:14,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:21:14,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142565115] [2024-12-02 14:21:14,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:21:14,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:21:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:21:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 400 proven. 100 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2024-12-02 14:21:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:21:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142565115] [2024-12-02 14:21:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142565115] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:21:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506875812] [2024-12-02 14:21:16,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:21:16,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:21:16,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:21:16,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:21:16,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 14:21:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:21:17,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 14:21:17,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:21:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-12-02 14:21:17,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:21:17,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506875812] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:21:17,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:21:17,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-12-02 14:21:17,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703547777] [2024-12-02 14:21:17,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:21:17,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:21:17,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:21:17,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:21:17,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:21:17,524 INFO L87 Difference]: Start difference. First operand 197117 states and 203030 transitions. Second operand has 4 states, 4 states have (on average 180.5) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:21:23,946 INFO L93 Difference]: Finished difference Result 428994 states and 442044 transitions. [2024-12-02 14:21:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:21:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 180.5) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 929 [2024-12-02 14:21:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:21:24,151 INFO L225 Difference]: With dead ends: 428994 [2024-12-02 14:21:24,151 INFO L226 Difference]: Without dead ends: 243686 [2024-12-02 14:21:24,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 934 GetRequests, 927 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:21:24,221 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 1630 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 5829 mSolverCounterSat, 640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 6469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 640 IncrementalHoareTripleChecker+Valid, 5829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:21:24,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 710 Invalid, 6469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [640 Valid, 5829 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-12-02 14:21:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243686 states. [2024-12-02 14:21:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243686 to 238862. [2024-12-02 14:21:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238862 states, 238861 states have (on average 1.0299211675409548) internal successors, (246008), 238861 states have internal predecessors, (246008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238862 states to 238862 states and 246008 transitions. [2024-12-02 14:21:26,466 INFO L78 Accepts]: Start accepts. Automaton has 238862 states and 246008 transitions. Word has length 929 [2024-12-02 14:21:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:21:26,466 INFO L471 AbstractCegarLoop]: Abstraction has 238862 states and 246008 transitions. [2024-12-02 14:21:26,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.5) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 238862 states and 246008 transitions. [2024-12-02 14:21:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2024-12-02 14:21:26,486 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:21:26,486 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:21:26,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-02 14:21:26,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 14:21:26,687 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:21:26,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:21:26,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1716205094, now seen corresponding path program 1 times [2024-12-02 14:21:26,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:21:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897776100] [2024-12-02 14:21:26,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:21:26,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:21:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:21:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 588 proven. 223 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-12-02 14:21:28,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:21:28,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897776100] [2024-12-02 14:21:28,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897776100] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:21:28,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649890606] [2024-12-02 14:21:28,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:21:28,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:21:28,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:21:28,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:21:28,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 14:21:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:21:28,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 14:21:28,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:21:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 588 proven. 223 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-12-02 14:21:29,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:21:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 588 proven. 223 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-12-02 14:21:31,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649890606] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:21:31,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:21:31,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-12-02 14:21:31,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401629673] [2024-12-02 14:21:31,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:21:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:21:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:21:31,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:21:31,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:21:31,109 INFO L87 Difference]: Start difference. First operand 238862 states and 246008 transitions. Second operand has 7 states, 7 states have (on average 211.42857142857142) internal successors, (1480), 6 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:21:47,600 INFO L93 Difference]: Finished difference Result 531236 states and 547678 transitions. [2024-12-02 14:21:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 14:21:47,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 211.42857142857142) internal successors, (1480), 6 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 956 [2024-12-02 14:21:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:21:48,100 INFO L225 Difference]: With dead ends: 531236 [2024-12-02 14:21:48,100 INFO L226 Difference]: Without dead ends: 293939 [2024-12-02 14:21:48,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1920 GetRequests, 1908 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-12-02 14:21:48,139 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 7283 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 20108 mSolverCounterSat, 2145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7283 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 22253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2145 IncrementalHoareTripleChecker+Valid, 20108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-12-02 14:21:48,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7283 Valid, 1062 Invalid, 22253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2145 Valid, 20108 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2024-12-02 14:21:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293939 states. [2024-12-02 14:21:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293939 to 238026. [2024-12-02 14:21:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238026 states, 238025 states have (on average 1.025178027518118) internal successors, (244018), 238025 states have internal predecessors, (244018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238026 states to 238026 states and 244018 transitions. [2024-12-02 14:21:50,662 INFO L78 Accepts]: Start accepts. Automaton has 238026 states and 244018 transitions. Word has length 956 [2024-12-02 14:21:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:21:50,663 INFO L471 AbstractCegarLoop]: Abstraction has 238026 states and 244018 transitions. [2024-12-02 14:21:50,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.42857142857142) internal successors, (1480), 6 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 238026 states and 244018 transitions. [2024-12-02 14:21:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1154 [2024-12-02 14:21:50,716 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:21:50,716 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:21:50,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 14:21:50,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 14:21:50,917 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:21:50,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:21:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2125587431, now seen corresponding path program 1 times [2024-12-02 14:21:50,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:21:50,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117208009] [2024-12-02 14:21:50,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:21:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:21:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:21:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-12-02 14:21:52,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:21:52,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117208009] [2024-12-02 14:21:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117208009] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:21:52,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:21:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:21:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478223911] [2024-12-02 14:21:52,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:21:52,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:21:52,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:21:52,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:21:52,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:21:52,670 INFO L87 Difference]: Start difference. First operand 238026 states and 244018 transitions. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:21:56,386 INFO L93 Difference]: Finished difference Result 481581 states and 493777 transitions. [2024-12-02 14:21:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:21:56,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1153 [2024-12-02 14:21:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:21:56,603 INFO L225 Difference]: With dead ends: 481581 [2024-12-02 14:21:56,603 INFO L226 Difference]: Without dead ends: 247492 [2024-12-02 14:21:56,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:21:56,694 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 563 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-12-02 14:21:56,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1707 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-12-02 14:21:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247492 states. [2024-12-02 14:21:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247492 to 241964. [2024-12-02 14:21:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241964 states, 241963 states have (on average 1.0248219769138256) internal successors, (247969), 241963 states have internal predecessors, (247969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241964 states to 241964 states and 247969 transitions. [2024-12-02 14:21:58,997 INFO L78 Accepts]: Start accepts. Automaton has 241964 states and 247969 transitions. Word has length 1153 [2024-12-02 14:21:58,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:21:58,998 INFO L471 AbstractCegarLoop]: Abstraction has 241964 states and 247969 transitions. [2024-12-02 14:21:58,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:21:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 241964 states and 247969 transitions. [2024-12-02 14:21:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1198 [2024-12-02 14:21:59,040 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:21:59,041 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:21:59,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 14:21:59,041 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:21:59,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:21:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1757012846, now seen corresponding path program 1 times [2024-12-02 14:21:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:21:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800737088] [2024-12-02 14:21:59,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:21:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:21:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 1056 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2024-12-02 14:22:00,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:00,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800737088] [2024-12-02 14:22:00,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800737088] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:00,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:22:00,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:22:00,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845528545] [2024-12-02 14:22:00,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:00,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:22:00,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:00,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:22:00,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:22:00,807 INFO L87 Difference]: Start difference. First operand 241964 states and 247969 transitions. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:22:04,475 INFO L93 Difference]: Finished difference Result 482342 states and 494695 transitions. [2024-12-02 14:22:04,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:22:04,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1197 [2024-12-02 14:22:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:22:04,710 INFO L225 Difference]: With dead ends: 482342 [2024-12-02 14:22:04,710 INFO L226 Difference]: Without dead ends: 256919 [2024-12-02 14:22:04,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:22:04,989 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 730 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-12-02 14:22:04,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1725 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-12-02 14:22:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256919 states. [2024-12-02 14:22:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256919 to 241954. [2024-12-02 14:22:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241954 states, 241953 states have (on average 1.0237980103573834) internal successors, (247711), 241953 states have internal predecessors, (247711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241954 states to 241954 states and 247711 transitions. [2024-12-02 14:22:07,171 INFO L78 Accepts]: Start accepts. Automaton has 241954 states and 247711 transitions. Word has length 1197 [2024-12-02 14:22:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:22:07,172 INFO L471 AbstractCegarLoop]: Abstraction has 241954 states and 247711 transitions. [2024-12-02 14:22:07,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 241954 states and 247711 transitions. [2024-12-02 14:22:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2024-12-02 14:22:07,214 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:22:07,215 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:07,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 14:22:07,215 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:22:07,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:07,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1104469618, now seen corresponding path program 1 times [2024-12-02 14:22:07,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:07,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173710283] [2024-12-02 14:22:07,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 684 proven. 100 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-12-02 14:22:10,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:22:10,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173710283] [2024-12-02 14:22:10,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173710283] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:22:10,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973580964] [2024-12-02 14:22:10,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:10,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:10,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:22:10,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:22:10,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 14:22:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:22:11,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 1419 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 14:22:11,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:22:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 709 proven. 0 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2024-12-02 14:22:12,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 14:22:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973580964] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:22:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 14:22:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-12-02 14:22:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932674097] [2024-12-02 14:22:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:22:12,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:22:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:22:12,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:22:12,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:22:12,290 INFO L87 Difference]: Start difference. First operand 241954 states and 247711 transitions. Second operand has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:22:16,187 INFO L93 Difference]: Finished difference Result 486314 states and 498009 transitions. [2024-12-02 14:22:16,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:22:16,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1213 [2024-12-02 14:22:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:22:16,417 INFO L225 Difference]: With dead ends: 486314 [2024-12-02 14:22:16,417 INFO L226 Difference]: Without dead ends: 260114 [2024-12-02 14:22:16,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1218 GetRequests, 1212 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:22:16,511 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 341 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2736 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:22:16,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 865 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2736 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-12-02 14:22:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260114 states. [2024-12-02 14:22:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260114 to 249039. [2024-12-02 14:22:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249039 states, 249038 states have (on average 1.0234783446702913) internal successors, (254885), 249038 states have internal predecessors, (254885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249039 states to 249039 states and 254885 transitions. [2024-12-02 14:22:19,224 INFO L78 Accepts]: Start accepts. Automaton has 249039 states and 254885 transitions. Word has length 1213 [2024-12-02 14:22:19,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:22:19,224 INFO L471 AbstractCegarLoop]: Abstraction has 249039 states and 254885 transitions. [2024-12-02 14:22:19,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:22:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 249039 states and 254885 transitions. [2024-12-02 14:22:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1343 [2024-12-02 14:22:19,276 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:22:19,276 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:19,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 14:22:19,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:22:19,477 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:22:19,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:22:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1874255302, now seen corresponding path program 1 times [2024-12-02 14:22:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:22:19,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969730700] [2024-12-02 14:22:19,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:22:19,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:22:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:22:19,670 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 14:22:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 14:22:20,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 14:22:20,143 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 14:22:20,144 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 14:22:20,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 14:22:20,152 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:22:20,516 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 14:22:20,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:22:20 BoogieIcfgContainer [2024-12-02 14:22:20,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 14:22:20,527 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 14:22:20,527 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 14:22:20,528 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 14:22:20,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:51" (3/4) ... [2024-12-02 14:22:20,530 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 14:22:21,150 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 1344. [2024-12-02 14:22:21,416 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 14:22:21,419 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 14:22:21,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 14:22:21,421 INFO L158 Benchmark]: Toolchain (without parser) took 218400.90ms. Allocated memory was 142.6MB in the beginning and 15.3GB in the end (delta: 15.1GB). Free memory was 101.1MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 10.0GB. Max. memory is 16.1GB. [2024-12-02 14:22:21,421 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 14:22:21,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1398.60ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 101.1MB in the beginning and 338.1MB in the end (delta: -237.0MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2024-12-02 14:22:21,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 480.28ms. Allocated memory is still 427.8MB. Free memory was 338.1MB in the beginning and 227.6MB in the end (delta: 110.5MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2024-12-02 14:22:21,421 INFO L158 Benchmark]: Boogie Preprocessor took 606.26ms. Allocated memory is still 427.8MB. Free memory was 226.8MB in the beginning and 268.0MB in the end (delta: -41.3MB). Peak memory consumption was 206.8MB. Max. memory is 16.1GB. [2024-12-02 14:22:21,422 INFO L158 Benchmark]: RCFGBuilder took 6290.11ms. Allocated memory was 427.8MB in the beginning and 1.3GB in the end (delta: 830.5MB). Free memory was 268.0MB in the beginning and 886.0MB in the end (delta: -618.0MB). Peak memory consumption was 583.8MB. Max. memory is 16.1GB. [2024-12-02 14:22:21,422 INFO L158 Benchmark]: TraceAbstraction took 208723.01ms. Allocated memory was 1.3GB in the beginning and 15.0GB in the end (delta: 13.8GB). Free memory was 886.0MB in the beginning and 5.2GB in the end (delta: -4.3GB). Peak memory consumption was 9.5GB. Max. memory is 16.1GB. [2024-12-02 14:22:21,422 INFO L158 Benchmark]: Witness Printer took 892.29ms. Allocated memory was 15.0GB in the beginning and 15.3GB in the end (delta: 251.7MB). Free memory was 5.2GB in the beginning and 5.8GB in the end (delta: -655.1MB). Peak memory consumption was 163.6MB. Max. memory is 16.1GB. [2024-12-02 14:22:21,423 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1398.60ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 101.1MB in the beginning and 338.1MB in the end (delta: -237.0MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 480.28ms. Allocated memory is still 427.8MB. Free memory was 338.1MB in the beginning and 227.6MB in the end (delta: 110.5MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 606.26ms. Allocated memory is still 427.8MB. Free memory was 226.8MB in the beginning and 268.0MB in the end (delta: -41.3MB). Peak memory consumption was 206.8MB. Max. memory is 16.1GB. * RCFGBuilder took 6290.11ms. Allocated memory was 427.8MB in the beginning and 1.3GB in the end (delta: 830.5MB). Free memory was 268.0MB in the beginning and 886.0MB in the end (delta: -618.0MB). Peak memory consumption was 583.8MB. Max. memory is 16.1GB. * TraceAbstraction took 208723.01ms. Allocated memory was 1.3GB in the beginning and 15.0GB in the end (delta: 13.8GB). Free memory was 886.0MB in the beginning and 5.2GB in the end (delta: -4.3GB). Peak memory consumption was 9.5GB. Max. memory is 16.1GB. * Witness Printer took 892.29ms. Allocated memory was 15.0GB in the beginning and 15.3GB in the end (delta: 251.7MB). Free memory was 5.2GB in the beginning and 5.8GB in the end (delta: -655.1MB). Peak memory consumption was 163.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 52]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int inputB = 2; [L21] int inputE = 5; [L22] int inputC = 3; [L23] int inputD = 4; [L24] int inputF = 6; [L27] int a26 = 1; [L28] int a13 = 0; [L29] int a19 = 9; [L30] int a23 = 158; [L31] int a12 = 286; [L32] int a1 = 2; VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L5813] int output = -1; VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L5819] int input; [L5820] input = __VERIFIER_nondet_int() [L5821] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5824] CALL, EXPR calculate_output(input) [L39] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L216] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L223] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L261] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L289] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L318] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L325] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L331] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L347] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L389] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L397] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !(((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !((((a1==3) && ((a19==9) && ( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5)) && !(a13==1))))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==11) && ((a13==1) && (((input == 5) && (a1==3)) && 476 < a23 )))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((!(a13==1) && (((((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13))) && (input == 4))) && (a1==2)) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==2) && (!(a13==1) && ((a19==10) && ((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L451] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==2) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11)))))) && !(a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a26==1) && (((((a1==2) && ((input == 2) && ((395 < a12) && (441 >= a12)) )) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(( 441 < a12 && ((a13==1) && ((a26==1) && (( ((95 < a23) && (264 >= a23)) && ((input == 2) && (a19==11))) && (a1==2)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !(((((((a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && (a1==2)) && (a19==9)) && 441 < a12 ) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L479] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((!(a13==1) && (input == 3)) && (a26==1)) && (a1==2)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a1==3) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a19==12) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L490] COND FALSE !(((a19==11) && ((!(a13==1) && ((a26==1) && (((input == 2) && ((178 < a12) && (395 >= a12)) ) && (a1==2)))) && a23 <= 95 ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a13==1) && (((a26==1) && ((((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))) && (input == 3))) && a12 <= 178 )) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !((((a1==3) && ((a13==1) && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && (a26==1)) && (a19==9)))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L515] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a19==11) && ((input == 6) && (a26==1))) && (a1==3)) && (a13==1)) && ((264 < a23) && (476 >= a23)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L521] COND FALSE !((( a12 <= 178 && (!(a13==1) && (((input == 6) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ((a19==9) && 476 < a23 )))) && (a26==1)))) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L527] COND FALSE !(((a1==3) && (!(a13==1) && ((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11)))) && (input == 3)) && ((395 < a12) && (441 >= a12)) ) && (a26==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((((a26==1) && ((a1==2) && ((input == 3) && ((((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10)))))) && (a13==1)) && 441 < a12 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !(( 476 < a23 && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a1==3) && ((a19==9) && (input == 2)))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((( ((178 < a12) && (395 >= a12)) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==12)) || ((a19==13) && a23 <= 95 )) || ((a19==13) && ((95 < a23) && (264 >= a23)) ))))) && !(a13==1)) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L553] COND FALSE !(((((a26==1) && (!(a13==1) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) && (input == 2)))) && a12 <= 178 ) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a26==1) && (((((a19==12) && ((input == 4) && ((264 < a23) && (476 >= a23)) )) && 441 < a12 ) && !(a13==1)) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !((((input == 3) && ((!(a13==1) && ((a19==13) && ((a1==2) && ( 441 < a12 && 476 < a23 )))) || (((( a23 <= 95 && a12 <= 178 ) && (a1==3)) && (a19==9)) && (a13==1)))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (((a1==3) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==13)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L603] COND FALSE !((( a12 <= 178 && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4)) && (a19==10)) && (a26==1)) && (a13==1))) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L606] COND FALSE !((((((a19==11) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)) && (a13==1))) && (a1==4)) && a12 <= 178 ) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L614] COND FALSE !((( a12 <= 178 && ((a1==3) && (((input == 5) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && (a26==1)))) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L620] COND FALSE !(((a19==11) && ( ((264 < a23) && (476 >= a23)) && ( ((395 < a12) && (441 >= a12)) && (((a26==1) && (!(a13==1) && (input == 3))) && (a1==3)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L627] COND FALSE !(((((a19==13) && (( 476 < a23 && ((a13==1) && (input == 2))) && a12 <= 178 )) && (a1==3)) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L634] COND FALSE !(( 441 < a12 && (( a23 <= 95 && ((((a13==1) && (input == 4)) && (a26==1)) && (a19==11))) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L640] COND FALSE !(((!(a13==1) && ((a26==1) && ((a1==3) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 5)) && ((178 < a12) && (395 >= a12)) )))) && (a19==13))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L646] COND FALSE !((((a26==1) && ((input == 5) && (((( ((395 < a12) && (441 >= a12)) && 476 < a23 ) && (a19==13)) && !(a13==1)) || ((( a23 <= 95 && 441 < a12 ) && (a19==9)) && (a13==1))))) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==3) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a26==1)) && !(a13==1))) && (a19==9)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((a1==2) && (!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && ((178 < a12) && (395 >= a12)) ))) && (a19==9)) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(((a19==11) && ((a1==3) && ( ((395 < a12) && (441 >= a12)) && ((((input == 6) && 476 < a23 ) && (a26==1)) && !(a13==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L669] COND FALSE !(((a26==1) && ( a12 <= 178 && (!(a13==1) && (((a19==13) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((((a13==1) && (( 441 < a12 && (((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1))) && (a19==9))) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L688] COND FALSE !((!(a13==1) && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a1==2) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)) && (a19==11))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(((a26==1) && (( ((95 < a23) && (264 >= a23)) && (( 441 < a12 && ((a1==3) && (input == 5))) && !(a13==1))) && (a19==13)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L718] COND FALSE !(((a1==3) && (((a26==1) && (((a19==10) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2))) && (a13==1))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L725] COND FALSE !(( 441 < a12 && ((a26==1) && (( ((264 < a23) && (476 >= a23)) && (((input == 5) && (a1==3)) && (a19==12))) && !(a13==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L731] COND FALSE !((((a19==11) && ( ((178 < a12) && (395 >= a12)) && (((a26==1) && ((input == 2) && (a1==3))) && ((95 < a23) && (264 >= a23)) ))) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L737] COND FALSE !((((a26==1) && ((a1==3) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)))))) && (a19==13))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L744] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (((((((a19==13) && ((264 < a23) && (476 >= a23)) ) && (a13==1)) || (( 476 < a23 && (a19==13)) && (a13==1))) || (( a23 <= 95 && (a19==9)) && !(a13==1))) && (input == 4)) && (a1==3))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !(((((a13==1) && ((( a12 <= 178 && (input == 4)) && a23 <= 95 ) && (a1==4))) && (a26==1)) && (a19==13))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a1==3) && ((a26==1) && ( a12 <= 178 && (!(a13==1) && ((input == 5) && (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L763] COND FALSE !(((a1==2) && (!(a13==1) && ( 441 < a12 && ((a19==13) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a26==1))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(((a19==13) && (((a1==3) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && (a26==1)) && a12 <= 178 )) && (a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !((((!(a13==1) && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==11)) || ( a23 <= 95 && (a19==12))))) && a12 <= 178 )) && (a1==4)) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L788] COND FALSE !(((( 441 < a12 && (!(a13==1) && ((a19==10) && ((a1==2) && (input == 4))))) && (a26==1)) && ((264 < a23) && (476 >= a23)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L794] COND FALSE !((((((a19==11) && ((a26==1) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))) && ((178 < a12) && (395 >= a12)) ) && (a1==2)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L801] COND FALSE !(((a19==13) && ((a26==1) && ((a1==3) && (( ((178 < a12) && (395 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && !(a13==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L810] COND FALSE !(((((a1==3) && ((a19==11) && (((input == 6) && a23 <= 95 ) && (a26==1)))) && !(a13==1)) && 441 < a12 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a19==12) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3))) && ((178 < a12) && (395 >= a12)) ) && (a26==1)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L822] COND FALSE !((((((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6)) && (a19==13))) && ((178 < a12) && (395 >= a12)) ) && (a26==1)) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L828] COND FALSE !(((a13==1) && (((a1==4) && (( ((95 < a23) && (264 >= a23)) && ((a19==13) && (input == 5))) && a12 <= 178 )) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L833] COND FALSE !(( 441 < a12 && ((a1==3) && ((a26==1) && ((a13==1) && ((a19==10) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L840] COND FALSE !(((a26==1) && ((a1==2) && ( ((395 < a12) && (441 >= a12)) && ( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && (input == 6)) && (a19==13))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L848] COND FALSE !(((a13==1) && (((a26==1) && (((((a19==11) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ((a19==10) && 476 < a23 ))) && (input == 3)) && (a1==3))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !(((a19==12) && ( ((264 < a23) && (476 >= a23)) && ((a26==1) && (((!(a13==1) && (input == 3)) && (a1==3)) && 441 < a12 ))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L871] COND FALSE !(((a26==1) && (!(a13==1) && ((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a19==11))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L877] COND FALSE !(( a12 <= 178 && ((a26==1) && ((a19==9) && ((((input == 6) && a23 <= 95 ) && (a13==1)) && (a1==4)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((!(a13==1) && ( a23 <= 95 && (a19==9))) || (((a13==1) && ((a19==13) && ((264 < a23) && (476 >= a23)) )) || (((a19==13) && 476 < a23 ) && (a13==1)))) && (input == 6)) && (a1==3)) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L891] COND FALSE !((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((a1==3) && ((input == 5) && ((95 < a23) && (264 >= a23)) )) && (a19==9)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L897] COND FALSE !(((((!(a13==1) && ((( ((95 < a23) && (264 >= a23)) && (a19==13)) || (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && (input == 5))) && (a1==2)) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L904] COND FALSE !(((((((a1==3) && ( 441 < a12 && (input == 6))) && (a26==1)) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((a26==1) && ( 441 < a12 && ((a19==11) && (((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && !(a13==1))))) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L926] COND FALSE !(((((a19==9) && ((a13==1) && ((a1==4) && ((input == 3) && (a26==1))))) && a23 <= 95 ) && a12 <= 178 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L931] COND FALSE !(((a26==1) && ( 476 < a23 && ((((a13==1) && ((input == 4) && a12 <= 178 )) && (a19==13)) && (a1==3))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L938] COND FALSE !(((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 2)) && (a1==2)))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L946] COND FALSE !(((a26==1) && ((a19==11) && ( 441 < a12 && ((a1==3) && (((input == 2) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && !(a13==1))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L959] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((!(a13==1) && ((((a19==13) && ((95 < a23) && (264 >= a23)) ) || (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && (input == 4))) && (a1==3))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L966] COND FALSE !(((a1==3) && (((a26==1) && ( 441 < a12 && (!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))))) && (a19==12)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L972] COND FALSE !((((a1==3) && ( a12 <= 178 && (((input == 2) && ((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) || ((a19==11) && ((95 < a23) && (264 >= a23)) ))) && !(a13==1)))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L978] COND FALSE !(((a26==1) && ((input == 2) && ((!(a13==1) && ((( 476 < a23 && 441 < a12 ) && (a1==2)) && (a19==13))) || (((a19==9) && ((a1==3) && ( a23 <= 95 && a12 <= 178 ))) && (a13==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L986] COND FALSE !((((((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==2)) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L993] COND FALSE !((((a19==13) && ((a13==1) && ((a1==3) && ((a26==1) && ( ((264 < a23) && (476 >= a23)) && (input == 5)))))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1000] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 4)) && (a19==12))) && (a26==1)) && !(a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && ((((( a23 <= 95 && (a19==10)) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9)))) && (input == 3)) && (a13==1)) && (a1==2))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1016] COND FALSE !((( a12 <= 178 && ((((input == 5) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))))) && (a13==1)) && (a26==1))) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1023] COND FALSE !(((a26==1) && ((a19==13) && ((((a1==3) && ((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && (a13==1)) && 441 < a12 )))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1031] COND FALSE !(((((a26==1) && ((a13==1) && (((a19==13) && (input == 5)) && a23 <= 95 ))) && a12 <= 178 ) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1037] COND FALSE !(((((a26==1) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2)) && (a19==13)) && !(a13==1))) && (a1==3)) && 441 < a12 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1044] COND FALSE !(( 441 < a12 && (((a26==1) && ((((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ( a23 <= 95 && (a19==10))) && (input == 3)) && !(a13==1))) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] COND FALSE !(((((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a19==13)) && (a26==1)) && ((178 < a12) && (395 >= a12)) ) && (a1==2)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1058] COND FALSE !(((a1==3) && ((a13==1) && (( ((395 < a12) && (441 >= a12)) && ((input == 2) && ((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )))) && (a26==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1065] COND FALSE !(((a1==3) && ((!(a13==1) && ( a12 <= 178 && (((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 6)))) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ( a23 <= 95 && (a19==9)))) || (!(a13==1) && ((a19==9) && ((95 < a23) && (264 >= a23)) ))) && (input == 3)) && (a1==2))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1079] COND FALSE !((((((a1==4) && ((input == 6) && (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && a12 <= 178 ) && (a13==1)) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1085] COND FALSE !(((!(a13==1) && ((a19==11) && ( 441 < a12 && ((a1==3) && ((a26==1) && (input == 4)))))) && a23 <= 95 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1092] COND FALSE !((((a26==1) && ((a19==10) && ((!(a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && a12 <= 178 ))) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1097] COND FALSE !((((a1==3) && ((a26==1) && ( 441 < a12 && ((input == 3) && (( ((95 < a23) && (264 >= a23)) && (a19==10)) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))))))) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1104] COND FALSE !(( 441 < a12 && (((a26==1) && ((a19==12) && (((input == 3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && !(a13==1)))) && (a1==2)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !((( 441 < a12 && ((a26==1) && ((((input == 5) && (a13==1)) && a23 <= 95 ) && (a19==13)))) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1126] COND FALSE !(((a26==1) && ( ((95 < a23) && (264 >= a23)) && ((a19==13) && (((a1==2) && (!(a13==1) && (input == 3))) && ((395 < a12) && (441 >= a12)) ))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1131] COND FALSE !((((((!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a1==2)) && 441 < a12 ) && (a19==9)) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1139] COND FALSE !((((((((input == 4) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && (a13==1)) && (a19==10)) && (a26==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1147] COND FALSE !((((!(a13==1) && (((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 3)) && a12 <= 178 )) && (a26==1)) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !((((input == 5) && ((((a19==13) && (( 476 < a23 && 441 < a12 ) && (a1==2))) && !(a13==1)) || (((a19==9) && ((a1==3) && ( a12 <= 178 && a23 <= 95 ))) && (a13==1)))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1163] COND FALSE !((((a19==9) && (!(a13==1) && (((a26==1) && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1170] COND FALSE !(((( a12 <= 178 && ((((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1)) && (a19==11))) && (a13==1)) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1176] COND FALSE !(( 441 < a12 && (((!(a13==1) && ((a1==3) && ((input == 3) && (a19==11)))) && a23 <= 95 ) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1181] COND FALSE !((((a1==3) && ( ((395 < a12) && (441 >= a12)) && ((a19==11) && ( ((264 < a23) && (476 >= a23)) && ((input == 4) && (a13==1)))))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1188] COND FALSE !(((a26==1) && ((a1==2) && (!(a13==1) && (((a19==11) && ( ((178 < a12) && (395 >= a12)) && (input == 3))) && a23 <= 95 ))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1196] COND FALSE !(((a26==1) && (( ((395 < a12) && (441 >= a12)) && (((a1==3) && ( ((264 < a23) && (476 >= a23)) && (input == 6))) && (a19==11))) && !(a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1204] COND FALSE !(((a13==1) && ((((a1==4) && ((((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 6))) && a12 <= 178 ) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1218] COND FALSE !((((a1==3) && (((a19==12) && ((a26==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))))) && !(a13==1))) && ((395 < a12) && (441 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1224] COND FALSE !(((!(a13==1) && ((((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 2)) && (a26==1)) && a12 <= 178 )) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1231] COND FALSE !((!(a13==1) && ( ((264 < a23) && (476 >= a23)) && (((a26==1) && (((a19==10) && (input == 5)) && (a1==2))) && 441 < a12 )))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1238] COND FALSE !(((a1==3) && ((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 2))) && (a19==13)) && (a26==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1245] COND FALSE !((((a1==2) && (((a26==1) && (((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ((a19==10) && ((95 < a23) && (264 >= a23)) )) && (input == 6))) && !(a13==1))) && 441 < a12 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1251] COND FALSE !(((a1==3) && ((((((((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 5)) && (a26==1)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !((((a1==3) && ((((a19==10) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ) && (input == 3))) && (a26==1)) && 441 < a12 )) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((input == 2) && (((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )))) && (a1==3))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1273] COND FALSE !(( a12 <= 178 && ((a1==3) && ((a13==1) && (((( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12)))) && (input == 6)) && (a26==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1281] COND FALSE !(((a19==9) && ((a26==1) && (((((a1==4) && (input == 4)) && a23 <= 95 ) && a12 <= 178 ) && (a13==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1293] COND FALSE !(((!(a13==1) && (((a19==11) && (( a23 <= 95 && (input == 6)) && ((178 < a12) && (395 >= a12)) )) && (a26==1))) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1300] COND FALSE !(((a1==2) && ((!(a13==1) && ((a19==13) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3))))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1308] COND FALSE !(( 476 < a23 && ((a1==3) && (((((input == 2) && ((395 < a12) && (441 >= a12)) ) && (a13==1)) && (a19==12)) && (a26==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1315] COND FALSE !((((a19==9) && (((((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a26==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) )) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1322] COND FALSE !((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((((input == 6) && (((a19==13) && a23 <= 95 ) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 )))) && (a1==2)) && (a26==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1329] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a26==1) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)) && (a13==1)) && (a19==10)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1335] COND FALSE !(((((a13==1) && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ((a19==12) && a23 <= 95 )))) && (a1==3))) && (a26==1)) && a12 <= 178 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1340] COND FALSE !(((a19==11) && ((a26==1) && ((!(a13==1) && (((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && ((395 < a12) && (441 >= a12)) )) && (a1==2))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1347] COND FALSE !(((a1==4) && (((a26==1) && ( a12 <= 178 && ((( 476 < a23 && (a19==11)) || ((a19==12) && a23 <= 95 )) && (input == 5)))) && (a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1353] COND FALSE !(( 441 < a12 && ((a19==13) && (!(a13==1) && ((((input == 4) && (a1==3)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1364] COND FALSE !(((a1==2) && ((a26==1) && ((!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a19==9))) && ((178 < a12) && (395 >= a12)) )))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1370] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==3) && (((( a23 <= 95 && (a19==10)) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9)))) && (input == 5)) && (a13==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1377] COND FALSE !(((((((a26==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a13==1)) && (a19==12)) && (a1==2)) && ((395 < a12) && (441 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1384] COND FALSE !(((( a12 <= 178 && ((a1==3) && ((a19==11) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))))) && !(a13==1)) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1394] COND FALSE !(( 441 < a12 && (((((input == 2) && (((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9))))) && !(a13==1)) && (a26==1)) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1400] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((((a13==1) && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==11)) && (a1==2))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1406] COND FALSE !(((a13==1) && (((a26==1) && (( ((395 < a12) && (441 >= a12)) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==2))) && (a19==12)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1414] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((((input == 5) && (((((a19==13) && ((264 < a23) && (476 >= a23)) ) && (a13==1)) || (( 476 < a23 && (a19==13)) && (a13==1))) || (((a19==9) && a23 <= 95 ) && !(a13==1)))) && (a1==3)) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1421] COND FALSE !(((((((( a23 <= 95 && (a19==13)) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 ))) && (input == 5)) && !(a13==1)) && a12 <= 178 ) && (a1==3)) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1427] COND FALSE !(((a19==13) && (((a26==1) && (!(a13==1) && ( ((95 < a23) && (264 >= a23)) && ((a1==3) && (input == 4))))) && a12 <= 178 ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1434] COND FALSE !((!(a13==1) && (((a19==11) && (((a1==2) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a26==1))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1442] COND FALSE !(((a1==4) && ( a12 <= 178 && ((a26==1) && (((((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ((a19==9) && 476 < a23 ))) && (input == 5)) && !(a13==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1457] COND FALSE !(((( ((95 < a23) && (264 >= a23)) && ((((a19==10) && (input == 3)) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) && (a13==1)) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1463] COND FALSE !(( 441 < a12 && ((((a26==1) && (((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ((a19==10) && 476 < a23 )) || ((a19==11) && a23 <= 95 )) && (input == 6))) && (a13==1)) && (a1==2)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1470] COND FALSE !((((a1==2) && (((((input == 6) && (a26==1)) && 441 < a12 ) && a23 <= 95 ) && (a19==13))) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1478] COND FALSE !(((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a19==12) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && (a1==3))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1485] COND FALSE !((( ((178 < a12) && (395 >= a12)) && (((!(a13==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5))) && (a19==12)) && (a26==1))) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1489] COND FALSE !(((((a26==1) && (( a23 <= 95 && ((input == 2) && a12 <= 178 )) && (a13==1))) && (a19==9)) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1495] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a1==2) && ((a26==1) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && !(a13==1)) && (a19==10)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1503] COND FALSE !(( 441 < a12 && ((a26==1) && ((a1==2) && ((a19==12) && ((( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 5)) && !(a13==1))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1511] COND FALSE !(((a1==3) && ( ((395 < a12) && (441 >= a12)) && (((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 2)) && (a26==1))) && (a19==9))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1518] COND FALSE !(((a1==2) && ( ((264 < a23) && (476 >= a23)) && ((a19==10) && (( 441 < a12 && ((a26==1) && (input == 6))) && !(a13==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1525] COND FALSE !((( a12 <= 178 && (((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1)) && (a19==9)) && !(a13==1))) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1538] COND FALSE !((((((((input == 5) && (a1==3)) && (a19==9)) && (a26==1)) && 476 < a23 ) && (a13==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1545] COND FALSE !(((a1==3) && ((( 476 < a23 && ((a19==11) && ((a26==1) && (input == 4)))) && ((395 < a12) && (441 >= a12)) ) && (a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1552] COND FALSE !((( ((264 < a23) && (476 >= a23)) && (((((a19==9) && (input == 3)) && (a1==2)) && 441 < a12 ) && !(a13==1))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1559] COND FALSE !(( 441 < a12 && (!(a13==1) && ((a1==2) && ((a26==1) && ((input == 3) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1567] COND FALSE !(((a1==4) && ((((a26==1) && ((a19==12) && ((input == 5) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))))) && (a13==1)) && a12 <= 178 ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (((a26==1) && ((a19==13) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a1==3)))) && !(a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1586] COND FALSE !(((a13==1) && ( a12 <= 178 && (((a26==1) && ((a1==3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)))) && (a19==11))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(((((a26==1) && ((a1==3) && ((a19==9) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3))))) && ((395 < a12) && (441 >= a12)) ) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1599] COND FALSE !(((a26==1) && ((( ((95 < a23) && (264 >= a23)) && (((input == 6) && !(a13==1)) && (a1==3))) && (a19==13)) && a12 <= 178 ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1602] COND FALSE !(((a26==1) && (!(a13==1) && ( a12 <= 178 && (((((a19==9) && 476 < a23 ) || ((a19==10) && a23 <= 95 )) && (input == 6)) && (a1==3)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1610] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((((a26==1) && (((input == 5) && (a1==3)) && (a19==10))) && a23 <= 95 ) && (a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1613] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((((a19==11) && ((input == 3) && (a1==2))) && (a13==1)) && ((395 < a12) && (441 >= a12)) )) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1625] COND FALSE !(( a12 <= 178 && ((a13==1) && (((a1==3) && ((input == 6) && (((a19==11) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10)))))) && (a26==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1632] COND FALSE !(((a13==1) && ((((((input == 6) && (a19==13)) && (a26==1)) && (a1==4)) && a23 <= 95 ) && a12 <= 178 ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1644] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (((((a19==9) && (input == 2)) && (a1==3)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) )))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1650] COND FALSE !(((a1==2) && ((a26==1) && ((a19==11) && ( 441 < a12 && (((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1656] COND FALSE !((((((((input == 6) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1)) && (a13==1)) && a12 <= 178 ) && (a1==3)) && (a19==10))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1662] COND FALSE !(((a26==1) && ((((a1==2) && ( 441 < a12 && ((input == 3) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))) && !(a13==1)) && (a19==13)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1668] COND FALSE !((!(a13==1) && ((a26==1) && (((a1==2) && (((a19==11) && (input == 2)) && ((95 < a23) && (264 >= a23)) )) && ((178 < a12) && (395 >= a12)) )))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1680] COND FALSE !(((a19==9) && (( 441 < a12 && ((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==2)) && !(a13==1))) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1688] COND FALSE !(((!(a13==1) && ((a19==11) && ( 441 < a12 && (((input == 4) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && (a1==3))))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1695] COND FALSE !((((input == 4) && (((((a1==2) && ( 476 < a23 && 441 < a12 )) && (a19==13)) && !(a13==1)) || ((a13==1) && ((a19==9) && ((a1==3) && ( a23 <= 95 && a12 <= 178 )))))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1703] COND FALSE !(((((a13==1) && (((a1==3) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a26==1))) && (a19==10)) && ((395 < a12) && (441 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1710] COND FALSE !(((a1==2) && (((((a13==1) && ((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && (a19==12)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1717] COND FALSE !((( a23 <= 95 && (((((input == 2) && (a13==1)) && (a1==4)) && a12 <= 178 ) && (a26==1))) && (a19==13))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1724] COND FALSE !(((a19==13) && ((a26==1) && ( ((395 < a12) && (441 >= a12)) && ( ((264 < a23) && (476 >= a23)) && (!(a13==1) && ((a1==2) && (input == 5)))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1731] COND FALSE !(((a26==1) && ((a1==3) && (((a13==1) && (((a19==10) && (input == 5)) && ((95 < a23) && (264 >= a23)) )) && ((178 < a12) && (395 >= a12)) )))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1738] COND FALSE !(((a1==3) && (( 441 < a12 && (!(a13==1) && ((input == 5) && (( 476 < a23 && (a19==12)) || ((a19==13) && a23 <= 95 ))))) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1753] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (!(a13==1) && ((a26==1) && ((a1==2) && ((a19==12) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1760] COND FALSE !((((a26==1) && ((a1==3) && ((((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && ((178 < a12) && (395 >= a12)) ) && (a19==11)))) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1769] COND FALSE !((!(a13==1) && ((( 441 < a12 && (((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3))) && (a19==9)) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1782] COND FALSE !(((((a26==1) && (((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5)) && a12 <= 178 ) && (a1==3))) && !(a13==1)) && (a19==9))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1785] COND FALSE !(((a26==1) && (((!(a13==1) && ((a1==3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)))) && ((395 < a12) && (441 >= a12)) ) && (a19==10)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1791] COND FALSE !(((a1==3) && (((((input == 3) && (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && 441 < a12 ) && !(a13==1)) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1805] COND FALSE !(((!(a13==1) && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)) && (a19==12)) && 441 < a12 ) && (a26==1))) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1817] COND FALSE !((((a1==2) && ((((a26==1) && ( ((395 < a12) && (441 >= a12)) && (input == 6))) && (a19==13)) && ((264 < a23) && (476 >= a23)) )) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1824] COND FALSE !(((a1==3) && (((((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && (a13==1)) && 441 < a12 ) && (a26==1)) && (a19==11)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1830] COND FALSE !((((( ((395 < a12) && (441 >= a12)) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)))) && (a13==1)) && (a19==11)) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1836] COND FALSE !((((a1==4) && ((a13==1) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)) && (a19==13)) && (a26==1)))) && a12 <= 178 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1848] COND FALSE !(((!(a13==1) && ( 441 < a12 && ((a19==13) && (((a26==1) && (input == 2)) && (a1==2))))) && a23 <= 95 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1855] COND FALSE !(( 441 < a12 && ((((a13==1) && (((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a19==9))) && (a26==1)) && (a1==2)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1870] COND FALSE !((((( ((395 < a12) && (441 >= a12)) && ((input == 5) && ((( 476 < a23 && (a19==12)) || ( a23 <= 95 && (a19==13))) || ((a19==13) && ((95 < a23) && (264 >= a23)) )))) && (a26==1)) && !(a13==1)) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1877] COND FALSE !((((a19==12) && (( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 2)) && (a1==3))) && (a13==1))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1889] COND FALSE !((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && (a13==1)) && (a19==10)) && ((395 < a12) && (441 >= a12)) )) && (a26==1))) [L1894] CALL, EXPR calculate_output2(input) [L1900] COND FALSE !(((a19==9) && ((a26==1) && (( 441 < a12 && (((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a13==1))) && (a1==3))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1911] COND FALSE !((((a1==3) && (!(a13==1) && (((a19==9) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2))) && ((395 < a12) && (441 >= a12)) ))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1918] COND FALSE !((!(a13==1) && ((((a26==1) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && (a19==13))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1925] COND FALSE !(((a26==1) && ( a23 <= 95 && (!(a13==1) && ((a19==10) && (( ((395 < a12) && (441 >= a12)) && (input == 2)) && (a1==3))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1931] COND FALSE !((((a19==13) && ((((a26==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && a12 <= 178 ) && (a1==3))) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1939] COND FALSE !(((a26==1) && (((a1==3) && ((input == 5) && (((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ( a23 <= 95 && (a19==9)))) || (((a19==9) && ((95 < a23) && (264 >= a23)) ) && !(a13==1))))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1946] COND FALSE !(( a12 <= 178 && (((a1==3) && ( ((95 < a23) && (264 >= a23)) && (((a19==10) && (input == 4)) && !(a13==1)))) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1952] COND FALSE !(((a1==2) && ( ((395 < a12) && (441 >= a12)) && ((((( ((95 < a23) && (264 >= a23)) && (a19==9)) && !(a13==1)) || ((( 476 < a23 && (a19==13)) && (a13==1)) || (!(a13==1) && ((a19==9) && a23 <= 95 )))) && (input == 6)) && (a26==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1960] COND FALSE !(( a12 <= 178 && ((a1==4) && (((( ((95 < a23) && (264 >= a23)) && (input == 2)) && (a13==1)) && (a26==1)) && (a19==13))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1973] COND FALSE !((( a12 <= 178 && ((a1==4) && (((a13==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a26==1)))) && (a19==13))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1986] COND FALSE !(( 476 < a23 && ((a13==1) && ((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==12))) && (a1==3)) && (a26==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1993] COND FALSE !((!(a13==1) && ((a1==2) && ((a26==1) && ( ((264 < a23) && (476 >= a23)) && ((a19==12) && ((input == 5) && ((178 < a12) && (395 >= a12)) ))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2000] COND FALSE !(((a19==11) && ((( a12 <= 178 && ((a26==1) && ((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))) && (a13==1)) && (a1==4)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2007] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)) && (a1==3))) && (a19==13))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2014] COND FALSE !(((a13==1) && (((( ((95 < a23) && (264 >= a23)) && ((input == 5) && a12 <= 178 )) && (a1==4)) && (a26==1)) && (a19==9)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2026] COND FALSE !((((a26==1) && (((!(a13==1) && (( ((395 < a12) && (441 >= a12)) && 476 < a23 ) && (a19==13))) || ((a13==1) && (( a23 <= 95 && 441 < a12 ) && (a19==9)))) && (input == 6))) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2034] COND FALSE !((!(a13==1) && ((((a26==1) && ( 441 < a12 && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)))) && (a19==13)) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2042] COND FALSE !((((a1==4) && ( a12 <= 178 && ((a26==1) && ((((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))) && (input == 4))))) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2048] COND FALSE !((!(a13==1) && (((((input == 2) && (( ((95 < a23) && (264 >= a23)) && (a19==11)) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )))) && (a26==1)) && (a1==2)) && 441 < a12 ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2063] COND FALSE !(((a13==1) && ((((a26==1) && ((input == 2) && (( a23 <= 95 && (a19==11)) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10)))))) && a12 <= 178 ) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2069] COND FALSE !((((((a26==1) && ((input == 5) && (((a19==11) && a23 <= 95 ) || (((a19==10) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==10)))))) && (a1==4)) && (a13==1)) && a12 <= 178 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2076] COND FALSE !(((a19==12) && ((( ((178 < a12) && (395 >= a12)) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a1==3))) && (a26==1)) && !(a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2082] COND FALSE !(((( 476 < a23 && (((a26==1) && ((input == 6) && (a19==10))) && !(a13==1))) && (a1==2)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2089] COND FALSE !((!(a13==1) && (((a26==1) && ((((input == 6) && ((264 < a23) && (476 >= a23)) ) && 441 < a12 ) && (a19==9))) && (a1==2)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2096] COND FALSE !(((((a1==3) && ((a26==1) && ((a19==11) && ( 441 < a12 && (input == 3))))) && a23 <= 95 ) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2103] COND FALSE !(((a19==13) && (((a13==1) && ((( a12 <= 178 && (input == 4)) && (a1==4)) && (a26==1))) && ((95 < a23) && (264 >= a23)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2108] COND FALSE !((((((a19==9) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && ((395 < a12) && (441 >= a12)) )) && (a13==1)) && (a26==1)) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2114] COND FALSE !((((a26==1) && (((input == 4) && (((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ((a19==9) && a23 <= 95 ))) || (!(a13==1) && ( ((95 < a23) && (264 >= a23)) && (a19==9))))) && ((178 < a12) && (395 >= a12)) )) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2121] COND FALSE !(( 441 < a12 && ((a13==1) && (( a23 <= 95 && ((a1==3) && ((a26==1) && (input == 2)))) && (a19==11))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2125] COND FALSE !(((a13==1) && (( 441 < a12 && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && (a1==3))) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2138] COND FALSE !((( ((395 < a12) && (441 >= a12)) && (((a19==9) && ((a26==1) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))) && !(a13==1))) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2145] COND FALSE !((((((a1==3) && (((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1))) && (a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a19==11))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2153] COND FALSE !((((a1==3) && ((a19==13) && ((!(a13==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && ((395 < a12) && (441 >= a12)) ))) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2159] COND FALSE !(((a26==1) && ( a12 <= 178 && ((a1==3) && (!(a13==1) && ((input == 6) && (((a19==13) && a23 <= 95 ) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2165] COND FALSE !(((a19==9) && ((a26==1) && ((a1==3) && (((a13==1) && (( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 3))) && a12 <= 178 ))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2170] COND FALSE !((((a13==1) && ((a1==2) && (((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4)) && ((395 < a12) && (441 >= a12)) ) && (a26==1)))) && (a19==9))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2177] COND FALSE !(((a1==2) && ((((((input == 5) && ((264 < a23) && (476 >= a23)) ) && 441 < a12 ) && !(a13==1)) && (a26==1)) && (a19==9)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2184] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a1==2) && (((((((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9))) || ( a23 <= 95 && (a19==10))) && (input == 2)) && (a26==1)) && (a13==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2191] COND FALSE !((((a26==1) && (((a1==2) && ((a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)))) && (a19==12))) && ((395 < a12) && (441 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2207] COND FALSE !(((a26==1) && (((a13==1) && ((((input == 5) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) )) && (a19==12)) && 441 < a12 )) && (a1==2)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2215] COND FALSE !(((a19==11) && ( ((178 < a12) && (395 >= a12)) && ((a26==1) && (( ((95 < a23) && (264 >= a23)) && ((input == 6) && (a1==2))) && !(a13==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2221] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (!(a13==1) && ((a19==12) && ((((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a26==1)) && (a1==3)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2228] COND FALSE !(( a23 <= 95 && ((a26==1) && ((a1==2) && ((a13==1) && ( ((395 < a12) && (441 >= a12)) && ((a19==11) && (input == 6)))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2235] COND FALSE !((!(a13==1) && (((a1==3) && ((((input == 2) && ( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && (a26==1)) && (a19==10))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2241] COND FALSE !((((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==12)) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13)))))) && (a26==1)) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2247] COND FALSE !(((a1==3) && ( a12 <= 178 && ((a19==11) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 2)) && (a26==1)) && (a13==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2259] COND FALSE !((((a19==12) && ((a26==1) && ( 441 < a12 && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ) && (input == 4)) && !(a13==1))))) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2274] COND FALSE !((( 441 < a12 && ((a19==13) && (((a26==1) && ((input == 3) && (a13==1))) && a23 <= 95 ))) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2281] COND FALSE !(( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a19==12) && ((a13==1) && (((input == 4) && (a26==1)) && (a1==3))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2289] COND FALSE !((( a12 <= 178 && (!(a13==1) && ((a26==1) && ((a1==4) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 6)))))) && (a19==11))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2302] COND FALSE !(((a1==3) && ((a26==1) && ((( ((178 < a12) && (395 >= a12)) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && !(a13==1)) && (a19==12))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2308] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a1==3)) && (a13==1)) && (a19==11)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2315] COND FALSE !(((a1==3) && (((a13==1) && (( 441 < a12 && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==10))) && (a26==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2322] COND FALSE !(((a19==9) && ((((a26==1) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && ((178 < a12) && (395 >= a12)) )) && !(a13==1)) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2329] COND FALSE !((((a1==4) && (((a19==10) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && a12 <= 178 )) && (a26==1))) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2344] COND FALSE !(((a13==1) && ((((a26==1) && ((input == 3) && (( a23 <= 95 && (a19==11)) || (((a19==10) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==10)))))) && a12 <= 178 ) && (a1==4)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2357] COND FALSE !((((a19==10) && ((a26==1) && ((!(a13==1) && ((input == 6) && (a1==3))) && ((264 < a23) && (476 >= a23)) ))) && a12 <= 178 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2363] COND FALSE !(((((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11)))) && (input == 2)) && !(a13==1)) && (a26==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2369] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==11) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)) && (a1==3))) && !(a13==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2377] COND FALSE !((((((((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ) && (input == 4)) && (a26==1)) && (a19==13)) && (a1==3)) && 441 < a12 ) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2391] COND FALSE !((!(a13==1) && ((a26==1) && ( 441 < a12 && ((a1==2) && ((a19==13) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 2)))))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2397] COND FALSE !(((a26==1) && (( ((178 < a12) && (395 >= a12)) && (((( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11))) && (input == 3)) && !(a13==1))) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2405] COND FALSE !(((!(a13==1) && ((a1==3) && ((((input == 6) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && (a26==1)) && 441 < a12 ))) && (a19==10))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2413] COND FALSE !((((a26==1) && ((((( 476 < a23 && ((395 < a12) && (441 >= a12)) ) && (a19==13)) && !(a13==1)) || ((a13==1) && (( 441 < a12 && a23 <= 95 ) && (a19==9)))) && (input == 4))) && (a1==2))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2421] COND FALSE !((((a1==3) && (((a26==1) && ((a19==11) && ((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))) && (a13==1))) && a12 <= 178 )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2424] COND FALSE !(((a19==13) && (( ((178 < a12) && (395 >= a12)) && (((a13==1) && ((input == 4) && ((264 < a23) && (476 >= a23)) )) && (a26==1))) && (a1==3)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2431] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a19==10) && ((a26==1) && (( 476 < a23 && ((a1==2) && (input == 5))) && !(a13==1)))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2438] COND FALSE !(((!(a13==1) && (( ((395 < a12) && (441 >= a12)) && (((a26==1) && (input == 4)) && (a19==11))) && 476 < a23 )) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2446] COND FALSE !((((a19==9) && ((a13==1) && (((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6)) && (a26==1)) && ((395 < a12) && (441 >= a12)) ))) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2452] COND FALSE !(((a1==2) && ((((a26==1) && ((a13==1) && ((input == 2) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )))) && (a19==12)) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2459] COND FALSE !((((((a19==11) && ((a26==1) && ((input == 2) && (a1==3)))) && ((264 < a23) && (476 >= a23)) ) && !(a13==1)) && ((395 < a12) && (441 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2466] COND FALSE !(((( a12 <= 178 && ((a1==3) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 5)))) && (a26==1)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2472] COND FALSE !(((((((((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )) && (input == 5)) && !(a13==1)) && (a26==1)) && ((178 < a12) && (395 >= a12)) ) && (a1==3))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2480] COND FALSE !(((( 476 < a23 && ( a12 <= 178 && ((a1==3) && ((input == 5) && (a13==1))))) && (a26==1)) && (a19==13))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2487] COND FALSE !(((a1==3) && (((a19==11) && ((a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && (a26==1)))) && a12 <= 178 ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2499] COND FALSE !((((a26==1) && ((a13==1) && ((a1==2) && ( ((395 < a12) && (441 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 5)))))) && (a19==9))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2506] COND FALSE !((!(a13==1) && ((((a1==2) && ((input == 6) && ((((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 )) || ((a19==13) && ((95 < a23) && (264 >= a23)) )))) && (a26==1)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2512] COND FALSE !(((((input == 3) && ((((a19==13) && ( 476 < a23 && ((395 < a12) && (441 >= a12)) )) && !(a13==1)) || ((a13==1) && (( a23 <= 95 && 441 < a12 ) && (a19==9))))) && (a1==2)) && (a26==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2520] COND FALSE !((((a19==11) && (((( ((395 < a12) && (441 >= a12)) && (input == 5)) && (a26==1)) && !(a13==1)) && (a1==3))) && ((264 < a23) && (476 >= a23)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2527] COND FALSE !(((a26==1) && (((a19==11) && ((a13==1) && (((input == 2) && (a1==2)) && a23 <= 95 ))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2532] COND FALSE !(((((a26==1) && ( 441 < a12 && ((( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 5)) && (a1==3)))) && (a19==10)) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2538] COND FALSE !(((a1==3) && ((((a19==10) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 5)) && a12 <= 178 )) && (a26==1)) && (a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2543] COND FALSE !(((((a13==1) && (((a19==13) && ((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && a12 <= 178 )) && (a26==1)) && (a1==4))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2549] COND FALSE !(((a13==1) && (((a19==11) && (((a26==1) && ((input == 2) && ((95 < a23) && (264 >= a23)) )) && ((395 < a12) && (441 >= a12)) )) && (a1==2)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2556] COND FALSE !((((a26==1) && ((a13==1) && ((((input == 5) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==9)))) && ((395 < a12) && (441 >= a12)) )) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2562] COND FALSE !(( a12 <= 178 && (((a1==4) && ((((input == 5) && (a26==1)) && !(a13==1)) && (a19==10))) && 476 < a23 ))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2569] COND FALSE !(((a26==1) && (((!(a13==1) && (((((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))) && (input == 5))) && ((178 < a12) && (395 >= a12)) ) && (a1==2)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2576] COND FALSE !(((a19==11) && ((a1==4) && (((((input == 5) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && a12 <= 178 ) && (a26==1)) && (a13==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2579] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==3) && (((input == 6) && (( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ((a19==9) && 476 < a23 )))) && (a26==1))) && (a13==1)))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2586] COND FALSE !(((a1==4) && ( a12 <= 178 && ((((a26==1) && (( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 4))) && (a19==12)) && (a13==1))))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] COND FALSE !((( a12 <= 178 && (!(a13==1) && ((((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a1==4)) && (a26==1)))) && (a19==10))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2611] COND FALSE !((( a12 <= 178 && ((a1==4) && ((a26==1) && ((a19==9) && ((input == 2) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )))))) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2624] COND FALSE !((((a26==1) && ((((((a19==12) && 476 < a23 ) || ( a23 <= 95 && (a19==13))) && (input == 6)) && 441 < a12 ) && (a1==3))) && !(a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2638] COND FALSE !((((((a19==12) && ( ((178 < a12) && (395 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6)))) && (a26==1)) && (a1==3)) && (a13==1))) VAL [a12=286, a13=0, a19=9, a1=2, a23=158, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2645] COND TRUE ((a1==2) && (((( ((178 < a12) && (395 >= a12)) && ((input == 3) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && (a19==9)) && !(a13==1)) && (a26==1))) [L2646] a23 = ((((a23 % 105)+ 337) - 296427) - -296439) [L2647] a19 = 10 [L2649] return 26; VAL [\result=26, a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1894] RET, EXPR calculate_output2(input) [L1894] return calculate_output2(input); [L5824] RET, EXPR calculate_output(input) [L5824] output = calculate_output(input) [L5819] int input; [L5820] input = __VERIFIER_nondet_int() [L5821] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5824] CALL, EXPR calculate_output(input) [L39] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L216] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L223] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L261] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L289] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L318] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L325] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L331] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L347] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L389] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L397] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !(((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2)))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !((((a1==3) && ((a19==9) && ( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5)) && !(a13==1))))) && (a26==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==11) && ((a13==1) && (((input == 5) && (a1==3)) && 476 < a23 )))) && (a26==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((!(a13==1) && (((((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13))) && (input == 4))) && (a1==2)) && (a26==1)))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==2) && (!(a13==1) && ((a19==10) && ((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L451] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==2) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11)))))) && !(a13==1)))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a26==1) && (((((a1==2) && ((input == 2) && ((395 < a12) && (441 >= a12)) )) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) ))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(( 441 < a12 && ((a13==1) && ((a26==1) && (( ((95 < a23) && (264 >= a23)) && ((input == 2) && (a19==11))) && (a1==2)))))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !(((((((a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && (a1==2)) && (a19==9)) && 441 < a12 ) && (a26==1))) VAL [a12=286, a13=0, a19=10, a1=2, a23=402, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L479] COND TRUE ( ((178 < a12) && (395 >= a12)) && ((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((!(a13==1) && (input == 3)) && (a26==1)) && (a1==2))))) [L480] a12 = (((a12 + 17844) / 5) + -3206) [L481] a23 = ((((a23 / -5) - 10205) + 138848) * -4) [L482] a19 = 9 [L483] a13 = 1 [L485] return 24; VAL [\result=24, a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L5824] RET, EXPR calculate_output(input) [L5824] output = calculate_output(input) [L5819] int input; [L5820] input = __VERIFIER_nondet_int() [L5821] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5824] CALL, EXPR calculate_output(input) [L39] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L216] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L223] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L261] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L289] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L318] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L325] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L331] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L347] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L389] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L397] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !(((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !((((a1==3) && ((a19==9) && ( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5)) && !(a13==1))))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==11) && ((a13==1) && (((input == 5) && (a1==3)) && 476 < a23 )))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((!(a13==1) && (((((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13))) && (input == 4))) && (a1==2)) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==2) && (!(a13==1) && ((a19==10) && ((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L451] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==2) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11)))))) && !(a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a26==1) && (((((a1==2) && ((input == 2) && ((395 < a12) && (441 >= a12)) )) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(( 441 < a12 && ((a13==1) && ((a26==1) && (( ((95 < a23) && (264 >= a23)) && ((input == 2) && (a19==11))) && (a1==2)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !(((((((a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && (a1==2)) && (a19==9)) && 441 < a12 ) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L479] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((!(a13==1) && (input == 3)) && (a26==1)) && (a1==2)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a1==3) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a19==12) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L490] COND FALSE !(((a19==11) && ((!(a13==1) && ((a26==1) && (((input == 2) && ((178 < a12) && (395 >= a12)) ) && (a1==2)))) && a23 <= 95 ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a13==1) && (((a26==1) && ((((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))) && (input == 3))) && a12 <= 178 )) && (a1==4))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !((((a1==3) && ((a13==1) && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && (a26==1)) && (a19==9)))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L515] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a19==11) && ((input == 6) && (a26==1))) && (a1==3)) && (a13==1)) && ((264 < a23) && (476 >= a23)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L521] COND FALSE !((( a12 <= 178 && (!(a13==1) && (((input == 6) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ((a19==9) && 476 < a23 )))) && (a26==1)))) && (a1==4))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L527] COND FALSE !(((a1==3) && (!(a13==1) && ((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11)))) && (input == 3)) && ((395 < a12) && (441 >= a12)) ) && (a26==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((((a26==1) && ((a1==2) && ((input == 3) && ((((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10)))))) && (a13==1)) && 441 < a12 )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !(( 476 < a23 && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a1==3) && ((a19==9) && (input == 2)))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((( ((178 < a12) && (395 >= a12)) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==12)) || ((a19==13) && a23 <= 95 )) || ((a19==13) && ((95 < a23) && (264 >= a23)) ))))) && !(a13==1)) && (a1==2))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L553] COND FALSE !(((((a26==1) && (!(a13==1) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) && (input == 2)))) && a12 <= 178 ) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a26==1) && (((((a19==12) && ((input == 4) && ((264 < a23) && (476 >= a23)) )) && 441 < a12 ) && !(a13==1)) && (a1==3)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !((((input == 3) && ((!(a13==1) && ((a19==13) && ((a1==2) && ( 441 < a12 && 476 < a23 )))) || (((( a23 <= 95 && a12 <= 178 ) && (a1==3)) && (a19==9)) && (a13==1)))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (((a1==3) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==13)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L603] COND FALSE !((( a12 <= 178 && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4)) && (a19==10)) && (a26==1)) && (a13==1))) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L606] COND FALSE !((((((a19==11) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)) && (a13==1))) && (a1==4)) && a12 <= 178 ) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L614] COND FALSE !((( a12 <= 178 && ((a1==3) && (((input == 5) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && (a26==1)))) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L620] COND FALSE !(((a19==11) && ( ((264 < a23) && (476 >= a23)) && ( ((395 < a12) && (441 >= a12)) && (((a26==1) && (!(a13==1) && (input == 3))) && (a1==3)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L627] COND FALSE !(((((a19==13) && (( 476 < a23 && ((a13==1) && (input == 2))) && a12 <= 178 )) && (a1==3)) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L634] COND FALSE !(( 441 < a12 && (( a23 <= 95 && ((((a13==1) && (input == 4)) && (a26==1)) && (a19==11))) && (a1==3)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L640] COND FALSE !(((!(a13==1) && ((a26==1) && ((a1==3) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 5)) && ((178 < a12) && (395 >= a12)) )))) && (a19==13))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L646] COND FALSE !((((a26==1) && ((input == 5) && (((( ((395 < a12) && (441 >= a12)) && 476 < a23 ) && (a19==13)) && !(a13==1)) || ((( a23 <= 95 && 441 < a12 ) && (a19==9)) && (a13==1))))) && (a1==2))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==3) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a26==1)) && !(a13==1))) && (a19==9)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((a1==2) && (!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && ((178 < a12) && (395 >= a12)) ))) && (a19==9)) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(((a19==11) && ((a1==3) && ( ((395 < a12) && (441 >= a12)) && ((((input == 6) && 476 < a23 ) && (a26==1)) && !(a13==1)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L669] COND FALSE !(((a26==1) && ( a12 <= 178 && (!(a13==1) && (((a19==13) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((((a13==1) && (( 441 < a12 && (((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1))) && (a19==9))) && (a1==2))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L688] COND FALSE !((!(a13==1) && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a1==2) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)) && (a19==11))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(((a26==1) && (( ((95 < a23) && (264 >= a23)) && (( 441 < a12 && ((a1==3) && (input == 5))) && !(a13==1))) && (a19==13)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L718] COND FALSE !(((a1==3) && (((a26==1) && (((a19==10) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2))) && (a13==1))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L725] COND FALSE !(( 441 < a12 && ((a26==1) && (( ((264 < a23) && (476 >= a23)) && (((input == 5) && (a1==3)) && (a19==12))) && !(a13==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L731] COND FALSE !((((a19==11) && ( ((178 < a12) && (395 >= a12)) && (((a26==1) && ((input == 2) && (a1==3))) && ((95 < a23) && (264 >= a23)) ))) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L737] COND FALSE !((((a26==1) && ((a1==3) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)))))) && (a19==13))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L744] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (((((((a19==13) && ((264 < a23) && (476 >= a23)) ) && (a13==1)) || (( 476 < a23 && (a19==13)) && (a13==1))) || (( a23 <= 95 && (a19==9)) && !(a13==1))) && (input == 4)) && (a1==3))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !(((((a13==1) && ((( a12 <= 178 && (input == 4)) && a23 <= 95 ) && (a1==4))) && (a26==1)) && (a19==13))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a1==3) && ((a26==1) && ( a12 <= 178 && (!(a13==1) && ((input == 5) && (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L763] COND FALSE !(((a1==2) && (!(a13==1) && ( 441 < a12 && ((a19==13) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a26==1))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(((a19==13) && (((a1==3) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && (a26==1)) && a12 <= 178 )) && (a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !((((!(a13==1) && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==11)) || ( a23 <= 95 && (a19==12))))) && a12 <= 178 )) && (a1==4)) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L788] COND FALSE !(((( 441 < a12 && (!(a13==1) && ((a19==10) && ((a1==2) && (input == 4))))) && (a26==1)) && ((264 < a23) && (476 >= a23)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L794] COND FALSE !((((((a19==11) && ((a26==1) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))) && ((178 < a12) && (395 >= a12)) ) && (a1==2)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L801] COND FALSE !(((a19==13) && ((a26==1) && ((a1==3) && (( ((178 < a12) && (395 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && !(a13==1)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L810] COND FALSE !(((((a1==3) && ((a19==11) && (((input == 6) && a23 <= 95 ) && (a26==1)))) && !(a13==1)) && 441 < a12 )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a19==12) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3))) && ((178 < a12) && (395 >= a12)) ) && (a26==1)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L822] COND FALSE !((((((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6)) && (a19==13))) && ((178 < a12) && (395 >= a12)) ) && (a26==1)) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L828] COND FALSE !(((a13==1) && (((a1==4) && (( ((95 < a23) && (264 >= a23)) && ((a19==13) && (input == 5))) && a12 <= 178 )) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L833] COND FALSE !(( 441 < a12 && ((a1==3) && ((a26==1) && ((a13==1) && ((a19==10) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L840] COND FALSE !(((a26==1) && ((a1==2) && ( ((395 < a12) && (441 >= a12)) && ( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && (input == 6)) && (a19==13))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L848] COND FALSE !(((a13==1) && (((a26==1) && (((((a19==11) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ((a19==10) && 476 < a23 ))) && (input == 3)) && (a1==3))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !(((a19==12) && ( ((264 < a23) && (476 >= a23)) && ((a26==1) && (((!(a13==1) && (input == 3)) && (a1==3)) && 441 < a12 ))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L871] COND FALSE !(((a26==1) && (!(a13==1) && ((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a19==11))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L877] COND FALSE !(( a12 <= 178 && ((a26==1) && ((a19==9) && ((((input == 6) && a23 <= 95 ) && (a13==1)) && (a1==4)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((!(a13==1) && ( a23 <= 95 && (a19==9))) || (((a13==1) && ((a19==13) && ((264 < a23) && (476 >= a23)) )) || (((a19==13) && 476 < a23 ) && (a13==1)))) && (input == 6)) && (a1==3)) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L891] COND FALSE !((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((a1==3) && ((input == 5) && ((95 < a23) && (264 >= a23)) )) && (a19==9)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L897] COND FALSE !(((((!(a13==1) && ((( ((95 < a23) && (264 >= a23)) && (a19==13)) || (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && (input == 5))) && (a1==2)) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L904] COND FALSE !(((((((a1==3) && ( 441 < a12 && (input == 6))) && (a26==1)) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((a26==1) && ( 441 < a12 && ((a19==11) && (((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && !(a13==1))))) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L926] COND FALSE !(((((a19==9) && ((a13==1) && ((a1==4) && ((input == 3) && (a26==1))))) && a23 <= 95 ) && a12 <= 178 )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L931] COND FALSE !(((a26==1) && ( 476 < a23 && ((((a13==1) && ((input == 4) && a12 <= 178 )) && (a19==13)) && (a1==3))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L938] COND FALSE !(((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 2)) && (a1==2)))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L946] COND FALSE !(((a26==1) && ((a19==11) && ( 441 < a12 && ((a1==3) && (((input == 2) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && !(a13==1))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L959] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((!(a13==1) && ((((a19==13) && ((95 < a23) && (264 >= a23)) ) || (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && (input == 4))) && (a1==3))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L966] COND FALSE !(((a1==3) && (((a26==1) && ( 441 < a12 && (!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))))) && (a19==12)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L972] COND FALSE !((((a1==3) && ( a12 <= 178 && (((input == 2) && ((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) || ((a19==11) && ((95 < a23) && (264 >= a23)) ))) && !(a13==1)))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L978] COND FALSE !(((a26==1) && ((input == 2) && ((!(a13==1) && ((( 476 < a23 && 441 < a12 ) && (a1==2)) && (a19==13))) || (((a19==9) && ((a1==3) && ( a23 <= 95 && a12 <= 178 ))) && (a13==1)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L986] COND FALSE !((((((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==2)) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L993] COND FALSE !((((a19==13) && ((a13==1) && ((a1==3) && ((a26==1) && ( ((264 < a23) && (476 >= a23)) && (input == 5)))))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1000] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 4)) && (a19==12))) && (a26==1)) && !(a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && ((((( a23 <= 95 && (a19==10)) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9)))) && (input == 3)) && (a13==1)) && (a1==2))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1016] COND FALSE !((( a12 <= 178 && ((((input == 5) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))))) && (a13==1)) && (a26==1))) && (a1==4))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1023] COND FALSE !(((a26==1) && ((a19==13) && ((((a1==3) && ((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && (a13==1)) && 441 < a12 )))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1031] COND FALSE !(((((a26==1) && ((a13==1) && (((a19==13) && (input == 5)) && a23 <= 95 ))) && a12 <= 178 ) && (a1==4))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1037] COND FALSE !(((((a26==1) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2)) && (a19==13)) && !(a13==1))) && (a1==3)) && 441 < a12 )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1044] COND FALSE !(( 441 < a12 && (((a26==1) && ((((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ( a23 <= 95 && (a19==10))) && (input == 3)) && !(a13==1))) && (a1==3)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] COND FALSE !(((((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a19==13)) && (a26==1)) && ((178 < a12) && (395 >= a12)) ) && (a1==2)) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1058] COND FALSE !(((a1==3) && ((a13==1) && (( ((395 < a12) && (441 >= a12)) && ((input == 2) && ((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )))) && (a26==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1065] COND FALSE !(((a1==3) && ((!(a13==1) && ( a12 <= 178 && (((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 6)))) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ( a23 <= 95 && (a19==9)))) || (!(a13==1) && ((a19==9) && ((95 < a23) && (264 >= a23)) ))) && (input == 3)) && (a1==2))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1079] COND FALSE !((((((a1==4) && ((input == 6) && (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && a12 <= 178 ) && (a13==1)) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1085] COND FALSE !(((!(a13==1) && ((a19==11) && ( 441 < a12 && ((a1==3) && ((a26==1) && (input == 4)))))) && a23 <= 95 )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1092] COND FALSE !((((a26==1) && ((a19==10) && ((!(a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && a12 <= 178 ))) && (a1==4))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1097] COND FALSE !((((a1==3) && ((a26==1) && ( 441 < a12 && ((input == 3) && (( ((95 < a23) && (264 >= a23)) && (a19==10)) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))))))) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1104] COND FALSE !(( 441 < a12 && (((a26==1) && ((a19==12) && (((input == 3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && !(a13==1)))) && (a1==2)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !((( 441 < a12 && ((a26==1) && ((((input == 5) && (a13==1)) && a23 <= 95 ) && (a19==13)))) && (a1==2))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1126] COND FALSE !(((a26==1) && ( ((95 < a23) && (264 >= a23)) && ((a19==13) && (((a1==2) && (!(a13==1) && (input == 3))) && ((395 < a12) && (441 >= a12)) ))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1131] COND FALSE !((((((!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a1==2)) && 441 < a12 ) && (a19==9)) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1139] COND FALSE !((((((((input == 4) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && (a13==1)) && (a19==10)) && (a26==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==2))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1147] COND FALSE !((((!(a13==1) && (((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 3)) && a12 <= 178 )) && (a26==1)) && (a1==4))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !((((input == 5) && ((((a19==13) && (( 476 < a23 && 441 < a12 ) && (a1==2))) && !(a13==1)) || (((a19==9) && ((a1==3) && ( a12 <= 178 && a23 <= 95 ))) && (a13==1)))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1163] COND FALSE !((((a19==9) && (!(a13==1) && (((a26==1) && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1170] COND FALSE !(((( a12 <= 178 && ((((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1)) && (a19==11))) && (a13==1)) && (a1==4))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1176] COND FALSE !(( 441 < a12 && (((!(a13==1) && ((a1==3) && ((input == 3) && (a19==11)))) && a23 <= 95 ) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1181] COND FALSE !((((a1==3) && ( ((395 < a12) && (441 >= a12)) && ((a19==11) && ( ((264 < a23) && (476 >= a23)) && ((input == 4) && (a13==1)))))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1188] COND FALSE !(((a26==1) && ((a1==2) && (!(a13==1) && (((a19==11) && ( ((178 < a12) && (395 >= a12)) && (input == 3))) && a23 <= 95 ))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1196] COND FALSE !(((a26==1) && (( ((395 < a12) && (441 >= a12)) && (((a1==3) && ( ((264 < a23) && (476 >= a23)) && (input == 6))) && (a19==11))) && !(a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1204] COND FALSE !(((a13==1) && ((((a1==4) && ((((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 6))) && a12 <= 178 ) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1218] COND FALSE !((((a1==3) && (((a19==12) && ((a26==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))))) && !(a13==1))) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1224] COND FALSE !(((!(a13==1) && ((((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 2)) && (a26==1)) && a12 <= 178 )) && (a1==4))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1231] COND FALSE !((!(a13==1) && ( ((264 < a23) && (476 >= a23)) && (((a26==1) && (((a19==10) && (input == 5)) && (a1==2))) && 441 < a12 )))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1238] COND FALSE !(((a1==3) && ((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 2))) && (a19==13)) && (a26==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1245] COND FALSE !((((a1==2) && (((a26==1) && (((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ((a19==10) && ((95 < a23) && (264 >= a23)) )) && (input == 6))) && !(a13==1))) && 441 < a12 )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1251] COND FALSE !(((a1==3) && ((((((((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 5)) && (a26==1)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !((((a1==3) && ((((a19==10) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ) && (input == 3))) && (a26==1)) && 441 < a12 )) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((input == 2) && (((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )))) && (a1==3))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1273] COND FALSE !(( a12 <= 178 && ((a1==3) && ((a13==1) && (((( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12)))) && (input == 6)) && (a26==1)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1281] COND FALSE !(((a19==9) && ((a26==1) && (((((a1==4) && (input == 4)) && a23 <= 95 ) && a12 <= 178 ) && (a13==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1293] COND FALSE !(((!(a13==1) && (((a19==11) && (( a23 <= 95 && (input == 6)) && ((178 < a12) && (395 >= a12)) )) && (a26==1))) && (a1==2))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1300] COND FALSE !(((a1==2) && ((!(a13==1) && ((a19==13) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3))))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1308] COND FALSE !(( 476 < a23 && ((a1==3) && (((((input == 2) && ((395 < a12) && (441 >= a12)) ) && (a13==1)) && (a19==12)) && (a26==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1315] COND FALSE !((((a19==9) && (((((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a26==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) )) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1322] COND FALSE !((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((((input == 6) && (((a19==13) && a23 <= 95 ) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 )))) && (a1==2)) && (a26==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1329] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a26==1) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)) && (a13==1)) && (a19==10)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1335] COND FALSE !(((((a13==1) && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ((a19==12) && a23 <= 95 )))) && (a1==3))) && (a26==1)) && a12 <= 178 )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1340] COND FALSE !(((a19==11) && ((a26==1) && ((!(a13==1) && (((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && ((395 < a12) && (441 >= a12)) )) && (a1==2))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1347] COND FALSE !(((a1==4) && (((a26==1) && ( a12 <= 178 && ((( 476 < a23 && (a19==11)) || ((a19==12) && a23 <= 95 )) && (input == 5)))) && (a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1353] COND FALSE !(( 441 < a12 && ((a19==13) && (!(a13==1) && ((((input == 4) && (a1==3)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1364] COND FALSE !(((a1==2) && ((a26==1) && ((!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a19==9))) && ((178 < a12) && (395 >= a12)) )))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1370] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==3) && (((( a23 <= 95 && (a19==10)) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9)))) && (input == 5)) && (a13==1)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1377] COND FALSE !(((((((a26==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a13==1)) && (a19==12)) && (a1==2)) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1384] COND FALSE !(((( a12 <= 178 && ((a1==3) && ((a19==11) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))))) && !(a13==1)) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1394] COND FALSE !(( 441 < a12 && (((((input == 2) && (((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9))))) && !(a13==1)) && (a26==1)) && (a1==3)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1400] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((((a13==1) && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==11)) && (a1==2))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1406] COND FALSE !(((a13==1) && (((a26==1) && (( ((395 < a12) && (441 >= a12)) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==2))) && (a19==12)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1414] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((((input == 5) && (((((a19==13) && ((264 < a23) && (476 >= a23)) ) && (a13==1)) || (( 476 < a23 && (a19==13)) && (a13==1))) || (((a19==9) && a23 <= 95 ) && !(a13==1)))) && (a1==3)) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1421] COND FALSE !(((((((( a23 <= 95 && (a19==13)) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 ))) && (input == 5)) && !(a13==1)) && a12 <= 178 ) && (a1==3)) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1427] COND FALSE !(((a19==13) && (((a26==1) && (!(a13==1) && ( ((95 < a23) && (264 >= a23)) && ((a1==3) && (input == 4))))) && a12 <= 178 ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1434] COND FALSE !((!(a13==1) && (((a19==11) && (((a1==2) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a26==1))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1442] COND FALSE !(((a1==4) && ( a12 <= 178 && ((a26==1) && (((((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ((a19==9) && 476 < a23 ))) && (input == 5)) && !(a13==1)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1457] COND FALSE !(((( ((95 < a23) && (264 >= a23)) && ((((a19==10) && (input == 3)) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) && (a13==1)) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1463] COND FALSE !(( 441 < a12 && ((((a26==1) && (((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ((a19==10) && 476 < a23 )) || ((a19==11) && a23 <= 95 )) && (input == 6))) && (a13==1)) && (a1==2)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1470] COND FALSE !((((a1==2) && (((((input == 6) && (a26==1)) && 441 < a12 ) && a23 <= 95 ) && (a19==13))) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1478] COND FALSE !(((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a19==12) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && (a1==3))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1485] COND FALSE !((( ((178 < a12) && (395 >= a12)) && (((!(a13==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5))) && (a19==12)) && (a26==1))) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1489] COND FALSE !(((((a26==1) && (( a23 <= 95 && ((input == 2) && a12 <= 178 )) && (a13==1))) && (a19==9)) && (a1==4))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1495] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a1==2) && ((a26==1) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && !(a13==1)) && (a19==10)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1503] COND FALSE !(( 441 < a12 && ((a26==1) && ((a1==2) && ((a19==12) && ((( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 5)) && !(a13==1))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1511] COND FALSE !(((a1==3) && ( ((395 < a12) && (441 >= a12)) && (((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 2)) && (a26==1))) && (a19==9))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1518] COND FALSE !(((a1==2) && ( ((264 < a23) && (476 >= a23)) && ((a19==10) && (( 441 < a12 && ((a26==1) && (input == 6))) && !(a13==1)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1525] COND FALSE !((( a12 <= 178 && (((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1)) && (a19==9)) && !(a13==1))) && (a1==4))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1538] COND FALSE !((((((((input == 5) && (a1==3)) && (a19==9)) && (a26==1)) && 476 < a23 ) && (a13==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1545] COND FALSE !(((a1==3) && ((( 476 < a23 && ((a19==11) && ((a26==1) && (input == 4)))) && ((395 < a12) && (441 >= a12)) ) && (a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1552] COND FALSE !((( ((264 < a23) && (476 >= a23)) && (((((a19==9) && (input == 3)) && (a1==2)) && 441 < a12 ) && !(a13==1))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1559] COND FALSE !(( 441 < a12 && (!(a13==1) && ((a1==2) && ((a26==1) && ((input == 3) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1567] COND FALSE !(((a1==4) && ((((a26==1) && ((a19==12) && ((input == 5) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))))) && (a13==1)) && a12 <= 178 ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (((a26==1) && ((a19==13) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a1==3)))) && !(a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1586] COND FALSE !(((a13==1) && ( a12 <= 178 && (((a26==1) && ((a1==3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)))) && (a19==11))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(((((a26==1) && ((a1==3) && ((a19==9) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3))))) && ((395 < a12) && (441 >= a12)) ) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1599] COND FALSE !(((a26==1) && ((( ((95 < a23) && (264 >= a23)) && (((input == 6) && !(a13==1)) && (a1==3))) && (a19==13)) && a12 <= 178 ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1602] COND FALSE !(((a26==1) && (!(a13==1) && ( a12 <= 178 && (((((a19==9) && 476 < a23 ) || ((a19==10) && a23 <= 95 )) && (input == 6)) && (a1==3)))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1610] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((((a26==1) && (((input == 5) && (a1==3)) && (a19==10))) && a23 <= 95 ) && (a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1613] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((((a19==11) && ((input == 3) && (a1==2))) && (a13==1)) && ((395 < a12) && (441 >= a12)) )) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1625] COND FALSE !(( a12 <= 178 && ((a13==1) && (((a1==3) && ((input == 6) && (((a19==11) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10)))))) && (a26==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1632] COND FALSE !(((a13==1) && ((((((input == 6) && (a19==13)) && (a26==1)) && (a1==4)) && a23 <= 95 ) && a12 <= 178 ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1644] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (((((a19==9) && (input == 2)) && (a1==3)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) )))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1650] COND FALSE !(((a1==2) && ((a26==1) && ((a19==11) && ( 441 < a12 && (((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1656] COND FALSE !((((((((input == 6) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1)) && (a13==1)) && a12 <= 178 ) && (a1==3)) && (a19==10))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1662] COND FALSE !(((a26==1) && ((((a1==2) && ( 441 < a12 && ((input == 3) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))) && !(a13==1)) && (a19==13)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1668] COND FALSE !((!(a13==1) && ((a26==1) && (((a1==2) && (((a19==11) && (input == 2)) && ((95 < a23) && (264 >= a23)) )) && ((178 < a12) && (395 >= a12)) )))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1680] COND FALSE !(((a19==9) && (( 441 < a12 && ((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==2)) && !(a13==1))) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1688] COND FALSE !(((!(a13==1) && ((a19==11) && ( 441 < a12 && (((input == 4) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && (a1==3))))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1695] COND FALSE !((((input == 4) && (((((a1==2) && ( 476 < a23 && 441 < a12 )) && (a19==13)) && !(a13==1)) || ((a13==1) && ((a19==9) && ((a1==3) && ( a23 <= 95 && a12 <= 178 )))))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1703] COND FALSE !(((((a13==1) && (((a1==3) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a26==1))) && (a19==10)) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1710] COND FALSE !(((a1==2) && (((((a13==1) && ((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && (a19==12)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1717] COND FALSE !((( a23 <= 95 && (((((input == 2) && (a13==1)) && (a1==4)) && a12 <= 178 ) && (a26==1))) && (a19==13))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1724] COND FALSE !(((a19==13) && ((a26==1) && ( ((395 < a12) && (441 >= a12)) && ( ((264 < a23) && (476 >= a23)) && (!(a13==1) && ((a1==2) && (input == 5)))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1731] COND FALSE !(((a26==1) && ((a1==3) && (((a13==1) && (((a19==10) && (input == 5)) && ((95 < a23) && (264 >= a23)) )) && ((178 < a12) && (395 >= a12)) )))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1738] COND FALSE !(((a1==3) && (( 441 < a12 && (!(a13==1) && ((input == 5) && (( 476 < a23 && (a19==12)) || ((a19==13) && a23 <= 95 ))))) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1753] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (!(a13==1) && ((a26==1) && ((a1==2) && ((a19==12) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1760] COND FALSE !((((a26==1) && ((a1==3) && ((((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && ((178 < a12) && (395 >= a12)) ) && (a19==11)))) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1769] COND FALSE !((!(a13==1) && ((( 441 < a12 && (((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3))) && (a19==9)) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1782] COND FALSE !(((((a26==1) && (((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5)) && a12 <= 178 ) && (a1==3))) && !(a13==1)) && (a19==9))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1785] COND FALSE !(((a26==1) && (((!(a13==1) && ((a1==3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)))) && ((395 < a12) && (441 >= a12)) ) && (a19==10)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1791] COND FALSE !(((a1==3) && (((((input == 3) && (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && 441 < a12 ) && !(a13==1)) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1805] COND FALSE !(((!(a13==1) && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)) && (a19==12)) && 441 < a12 ) && (a26==1))) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1817] COND FALSE !((((a1==2) && ((((a26==1) && ( ((395 < a12) && (441 >= a12)) && (input == 6))) && (a19==13)) && ((264 < a23) && (476 >= a23)) )) && !(a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1824] COND FALSE !(((a1==3) && (((((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && (a13==1)) && 441 < a12 ) && (a26==1)) && (a19==11)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1830] COND FALSE !((((( ((395 < a12) && (441 >= a12)) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)))) && (a13==1)) && (a19==11)) && (a1==2))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1836] COND FALSE !((((a1==4) && ((a13==1) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)) && (a19==13)) && (a26==1)))) && a12 <= 178 )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1848] COND FALSE !(((!(a13==1) && ( 441 < a12 && ((a19==13) && (((a26==1) && (input == 2)) && (a1==2))))) && a23 <= 95 )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1855] COND FALSE !(( 441 < a12 && ((((a13==1) && (((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a19==9))) && (a26==1)) && (a1==2)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1870] COND FALSE !((((( ((395 < a12) && (441 >= a12)) && ((input == 5) && ((( 476 < a23 && (a19==12)) || ( a23 <= 95 && (a19==13))) || ((a19==13) && ((95 < a23) && (264 >= a23)) )))) && (a26==1)) && !(a13==1)) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1877] COND FALSE !((((a19==12) && (( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 2)) && (a1==3))) && (a13==1))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1889] COND FALSE !((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && (a13==1)) && (a19==10)) && ((395 < a12) && (441 >= a12)) )) && (a26==1))) [L1894] CALL, EXPR calculate_output2(input) [L1900] COND FALSE !(((a19==9) && ((a26==1) && (( 441 < a12 && (((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a13==1))) && (a1==3))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1911] COND FALSE !((((a1==3) && (!(a13==1) && (((a19==9) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2))) && ((395 < a12) && (441 >= a12)) ))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1918] COND FALSE !((!(a13==1) && ((((a26==1) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && (a19==13))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1925] COND FALSE !(((a26==1) && ( a23 <= 95 && (!(a13==1) && ((a19==10) && (( ((395 < a12) && (441 >= a12)) && (input == 2)) && (a1==3))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1931] COND FALSE !((((a19==13) && ((((a26==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && a12 <= 178 ) && (a1==3))) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1939] COND FALSE !(((a26==1) && (((a1==3) && ((input == 5) && (((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ( a23 <= 95 && (a19==9)))) || (((a19==9) && ((95 < a23) && (264 >= a23)) ) && !(a13==1))))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1946] COND FALSE !(( a12 <= 178 && (((a1==3) && ( ((95 < a23) && (264 >= a23)) && (((a19==10) && (input == 4)) && !(a13==1)))) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1952] COND FALSE !(((a1==2) && ( ((395 < a12) && (441 >= a12)) && ((((( ((95 < a23) && (264 >= a23)) && (a19==9)) && !(a13==1)) || ((( 476 < a23 && (a19==13)) && (a13==1)) || (!(a13==1) && ((a19==9) && a23 <= 95 )))) && (input == 6)) && (a26==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1960] COND FALSE !(( a12 <= 178 && ((a1==4) && (((( ((95 < a23) && (264 >= a23)) && (input == 2)) && (a13==1)) && (a26==1)) && (a19==13))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1973] COND FALSE !((( a12 <= 178 && ((a1==4) && (((a13==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a26==1)))) && (a19==13))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1986] COND FALSE !(( 476 < a23 && ((a13==1) && ((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==12))) && (a1==3)) && (a26==1))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1993] COND FALSE !((!(a13==1) && ((a1==2) && ((a26==1) && ( ((264 < a23) && (476 >= a23)) && ((a19==12) && ((input == 5) && ((178 < a12) && (395 >= a12)) ))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2000] COND FALSE !(((a19==11) && ((( a12 <= 178 && ((a26==1) && ((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))) && (a13==1)) && (a1==4)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2007] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)) && (a1==3))) && (a19==13))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2014] COND FALSE !(((a13==1) && (((( ((95 < a23) && (264 >= a23)) && ((input == 5) && a12 <= 178 )) && (a1==4)) && (a26==1)) && (a19==9)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2026] COND FALSE !((((a26==1) && (((!(a13==1) && (( ((395 < a12) && (441 >= a12)) && 476 < a23 ) && (a19==13))) || ((a13==1) && (( a23 <= 95 && 441 < a12 ) && (a19==9)))) && (input == 6))) && (a1==2))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2034] COND FALSE !((!(a13==1) && ((((a26==1) && ( 441 < a12 && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)))) && (a19==13)) && (a1==3)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2042] COND FALSE !((((a1==4) && ( a12 <= 178 && ((a26==1) && ((((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))) && (input == 4))))) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2048] COND FALSE !((!(a13==1) && (((((input == 2) && (( ((95 < a23) && (264 >= a23)) && (a19==11)) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )))) && (a26==1)) && (a1==2)) && 441 < a12 ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2063] COND FALSE !(((a13==1) && ((((a26==1) && ((input == 2) && (( a23 <= 95 && (a19==11)) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10)))))) && a12 <= 178 ) && (a1==3)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2069] COND FALSE !((((((a26==1) && ((input == 5) && (((a19==11) && a23 <= 95 ) || (((a19==10) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==10)))))) && (a1==4)) && (a13==1)) && a12 <= 178 )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2076] COND FALSE !(((a19==12) && ((( ((178 < a12) && (395 >= a12)) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a1==3))) && (a26==1)) && !(a13==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2082] COND FALSE !(((( 476 < a23 && (((a26==1) && ((input == 6) && (a19==10))) && !(a13==1))) && (a1==2)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2089] COND FALSE !((!(a13==1) && (((a26==1) && ((((input == 6) && ((264 < a23) && (476 >= a23)) ) && 441 < a12 ) && (a19==9))) && (a1==2)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2096] COND FALSE !(((((a1==3) && ((a26==1) && ((a19==11) && ( 441 < a12 && (input == 3))))) && a23 <= 95 ) && (a13==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2103] COND FALSE !(((a19==13) && (((a13==1) && ((( a12 <= 178 && (input == 4)) && (a1==4)) && (a26==1))) && ((95 < a23) && (264 >= a23)) ))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2108] COND FALSE !((((((a19==9) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && ((395 < a12) && (441 >= a12)) )) && (a13==1)) && (a26==1)) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2114] COND FALSE !((((a26==1) && (((input == 4) && (((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ((a19==9) && a23 <= 95 ))) || (!(a13==1) && ( ((95 < a23) && (264 >= a23)) && (a19==9))))) && ((178 < a12) && (395 >= a12)) )) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2121] COND FALSE !(( 441 < a12 && ((a13==1) && (( a23 <= 95 && ((a1==3) && ((a26==1) && (input == 2)))) && (a19==11))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2125] COND FALSE !(((a13==1) && (( 441 < a12 && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && (a1==3))) && (a26==1)))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2138] COND FALSE !((( ((395 < a12) && (441 >= a12)) && (((a19==9) && ((a26==1) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))) && !(a13==1))) && (a1==3))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2145] COND FALSE !((((((a1==3) && (((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1))) && (a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a19==11))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2153] COND FALSE !((((a1==3) && ((a19==13) && ((!(a13==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && ((395 < a12) && (441 >= a12)) ))) && (a26==1))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2159] COND FALSE !(((a26==1) && ( a12 <= 178 && ((a1==3) && (!(a13==1) && ((input == 6) && (((a19==13) && a23 <= 95 ) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2165] COND FALSE !(((a19==9) && ((a26==1) && ((a1==3) && (((a13==1) && (( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 3))) && a12 <= 178 ))))) VAL [a12=420, a13=1, a19=9, a1=2, a23=-514252, a26=1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2170] COND TRUE (((a13==1) && ((a1==2) && (((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4)) && ((395 < a12) && (441 >= a12)) ) && (a26==1)))) && (a19==9)) [L2171] a23 = (((((a23 + 0) % 84)+ 179) - -424870) - 424869) [L2172] a1 = 3 [L2173] a19 = 13 [L2174] a13 = 0 [L2176] return 26; VAL [\result=26, a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1894] RET, EXPR calculate_output2(input) [L1894] return calculate_output2(input); [L5824] RET, EXPR calculate_output(input) [L5824] output = calculate_output(input) [L5819] int input; [L5820] input = __VERIFIER_nondet_int() [L5821] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5824] CALL, EXPR calculate_output(input) [L39] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L216] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L223] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L261] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L289] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L295] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L302] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L318] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L325] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L331] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L337] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L347] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L389] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L397] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !(((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !((((a1==3) && ((a19==9) && ( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5)) && !(a13==1))))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==11) && ((a13==1) && (((input == 5) && (a1==3)) && 476 < a23 )))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((!(a13==1) && (((((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13))) && (input == 4))) && (a1==2)) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==2) && (!(a13==1) && ((a19==10) && ((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L451] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==2) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11)))))) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a26==1) && (((((a1==2) && ((input == 2) && ((395 < a12) && (441 >= a12)) )) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(( 441 < a12 && ((a13==1) && ((a26==1) && (( ((95 < a23) && (264 >= a23)) && ((input == 2) && (a19==11))) && (a1==2)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L472] COND FALSE !(((((((a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && (a1==2)) && (a19==9)) && 441 < a12 ) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L479] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((!(a13==1) && (input == 3)) && (a26==1)) && (a1==2)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a1==3) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a19==12) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L490] COND FALSE !(((a19==11) && ((!(a13==1) && ((a26==1) && (((input == 2) && ((178 < a12) && (395 >= a12)) ) && (a1==2)))) && a23 <= 95 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a13==1) && (((a26==1) && ((((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))) && (input == 3))) && a12 <= 178 )) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !((((a1==3) && ((a13==1) && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && (a26==1)) && (a19==9)))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L515] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a19==11) && ((input == 6) && (a26==1))) && (a1==3)) && (a13==1)) && ((264 < a23) && (476 >= a23)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L521] COND FALSE !((( a12 <= 178 && (!(a13==1) && (((input == 6) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ((a19==9) && 476 < a23 )))) && (a26==1)))) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L527] COND FALSE !(((a1==3) && (!(a13==1) && ((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11)))) && (input == 3)) && ((395 < a12) && (441 >= a12)) ) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((((a26==1) && ((a1==2) && ((input == 3) && ((((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10)))))) && (a13==1)) && 441 < a12 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !(( 476 < a23 && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a1==3) && ((a19==9) && (input == 2)))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((( ((178 < a12) && (395 >= a12)) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==12)) || ((a19==13) && a23 <= 95 )) || ((a19==13) && ((95 < a23) && (264 >= a23)) ))))) && !(a13==1)) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L553] COND FALSE !(((((a26==1) && (!(a13==1) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) && (input == 2)))) && a12 <= 178 ) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a26==1) && (((((a19==12) && ((input == 4) && ((264 < a23) && (476 >= a23)) )) && 441 < a12 ) && !(a13==1)) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] COND FALSE !((((input == 3) && ((!(a13==1) && ((a19==13) && ((a1==2) && ( 441 < a12 && 476 < a23 )))) || (((( a23 <= 95 && a12 <= 178 ) && (a1==3)) && (a19==9)) && (a13==1)))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (((a1==3) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==13)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L603] COND FALSE !((( a12 <= 178 && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4)) && (a19==10)) && (a26==1)) && (a13==1))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L606] COND FALSE !((((((a19==11) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)) && (a13==1))) && (a1==4)) && a12 <= 178 ) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L614] COND FALSE !((( a12 <= 178 && ((a1==3) && (((input == 5) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && (a26==1)))) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L620] COND FALSE !(((a19==11) && ( ((264 < a23) && (476 >= a23)) && ( ((395 < a12) && (441 >= a12)) && (((a26==1) && (!(a13==1) && (input == 3))) && (a1==3)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L627] COND FALSE !(((((a19==13) && (( 476 < a23 && ((a13==1) && (input == 2))) && a12 <= 178 )) && (a1==3)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L634] COND FALSE !(( 441 < a12 && (( a23 <= 95 && ((((a13==1) && (input == 4)) && (a26==1)) && (a19==11))) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L640] COND FALSE !(((!(a13==1) && ((a26==1) && ((a1==3) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 5)) && ((178 < a12) && (395 >= a12)) )))) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L646] COND FALSE !((((a26==1) && ((input == 5) && (((( ((395 < a12) && (441 >= a12)) && 476 < a23 ) && (a19==13)) && !(a13==1)) || ((( a23 <= 95 && 441 < a12 ) && (a19==9)) && (a13==1))))) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==3) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a26==1)) && !(a13==1))) && (a19==9)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((a1==2) && (!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && ((178 < a12) && (395 >= a12)) ))) && (a19==9)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(((a19==11) && ((a1==3) && ( ((395 < a12) && (441 >= a12)) && ((((input == 6) && 476 < a23 ) && (a26==1)) && !(a13==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L669] COND FALSE !(((a26==1) && ( a12 <= 178 && (!(a13==1) && (((a19==13) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((((a13==1) && (( 441 < a12 && (((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1))) && (a19==9))) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L688] COND FALSE !((!(a13==1) && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a1==2) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)) && (a19==11))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L703] COND FALSE !(((a26==1) && (( ((95 < a23) && (264 >= a23)) && (( 441 < a12 && ((a1==3) && (input == 5))) && !(a13==1))) && (a19==13)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L718] COND FALSE !(((a1==3) && (((a26==1) && (((a19==10) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2))) && (a13==1))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L725] COND FALSE !(( 441 < a12 && ((a26==1) && (( ((264 < a23) && (476 >= a23)) && (((input == 5) && (a1==3)) && (a19==12))) && !(a13==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L731] COND FALSE !((((a19==11) && ( ((178 < a12) && (395 >= a12)) && (((a26==1) && ((input == 2) && (a1==3))) && ((95 < a23) && (264 >= a23)) ))) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L737] COND FALSE !((((a26==1) && ((a1==3) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)))))) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L744] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (((((((a19==13) && ((264 < a23) && (476 >= a23)) ) && (a13==1)) || (( 476 < a23 && (a19==13)) && (a13==1))) || (( a23 <= 95 && (a19==9)) && !(a13==1))) && (input == 4)) && (a1==3))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !(((((a13==1) && ((( a12 <= 178 && (input == 4)) && a23 <= 95 ) && (a1==4))) && (a26==1)) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a1==3) && ((a26==1) && ( a12 <= 178 && (!(a13==1) && ((input == 5) && (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L763] COND FALSE !(((a1==2) && (!(a13==1) && ( 441 < a12 && ((a19==13) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a26==1))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(((a19==13) && (((a1==3) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && (a26==1)) && a12 <= 178 )) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !((((!(a13==1) && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==11)) || ( a23 <= 95 && (a19==12))))) && a12 <= 178 )) && (a1==4)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L788] COND FALSE !(((( 441 < a12 && (!(a13==1) && ((a19==10) && ((a1==2) && (input == 4))))) && (a26==1)) && ((264 < a23) && (476 >= a23)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L794] COND FALSE !((((((a19==11) && ((a26==1) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))) && ((178 < a12) && (395 >= a12)) ) && (a1==2)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L801] COND FALSE !(((a19==13) && ((a26==1) && ((a1==3) && (( ((178 < a12) && (395 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && !(a13==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L810] COND FALSE !(((((a1==3) && ((a19==11) && (((input == 6) && a23 <= 95 ) && (a26==1)))) && !(a13==1)) && 441 < a12 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a19==12) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3))) && ((178 < a12) && (395 >= a12)) ) && (a26==1)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L822] COND FALSE !((((((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6)) && (a19==13))) && ((178 < a12) && (395 >= a12)) ) && (a26==1)) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L828] COND FALSE !(((a13==1) && (((a1==4) && (( ((95 < a23) && (264 >= a23)) && ((a19==13) && (input == 5))) && a12 <= 178 )) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L833] COND FALSE !(( 441 < a12 && ((a1==3) && ((a26==1) && ((a13==1) && ((a19==10) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L840] COND FALSE !(((a26==1) && ((a1==2) && ( ((395 < a12) && (441 >= a12)) && ( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && (input == 6)) && (a19==13))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L848] COND FALSE !(((a13==1) && (((a26==1) && (((((a19==11) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ((a19==10) && 476 < a23 ))) && (input == 3)) && (a1==3))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L855] COND FALSE !(((a19==12) && ( ((264 < a23) && (476 >= a23)) && ((a26==1) && (((!(a13==1) && (input == 3)) && (a1==3)) && 441 < a12 ))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L871] COND FALSE !(((a26==1) && (!(a13==1) && ((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a19==11))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L877] COND FALSE !(( a12 <= 178 && ((a26==1) && ((a19==9) && ((((input == 6) && a23 <= 95 ) && (a13==1)) && (a1==4)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((!(a13==1) && ( a23 <= 95 && (a19==9))) || (((a13==1) && ((a19==13) && ((264 < a23) && (476 >= a23)) )) || (((a19==13) && 476 < a23 ) && (a13==1)))) && (input == 6)) && (a1==3)) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L891] COND FALSE !((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((a1==3) && ((input == 5) && ((95 < a23) && (264 >= a23)) )) && (a19==9)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L897] COND FALSE !(((((!(a13==1) && ((( ((95 < a23) && (264 >= a23)) && (a19==13)) || (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && (input == 5))) && (a1==2)) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L904] COND FALSE !(((((((a1==3) && ( 441 < a12 && (input == 6))) && (a26==1)) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L911] COND FALSE !((((a26==1) && ( 441 < a12 && ((a19==11) && (((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && !(a13==1))))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L926] COND FALSE !(((((a19==9) && ((a13==1) && ((a1==4) && ((input == 3) && (a26==1))))) && a23 <= 95 ) && a12 <= 178 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L931] COND FALSE !(((a26==1) && ( 476 < a23 && ((((a13==1) && ((input == 4) && a12 <= 178 )) && (a19==13)) && (a1==3))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L938] COND FALSE !(((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 2)) && (a1==2)))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L946] COND FALSE !(((a26==1) && ((a19==11) && ( 441 < a12 && ((a1==3) && (((input == 2) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && !(a13==1))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L959] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((!(a13==1) && ((((a19==13) && ((95 < a23) && (264 >= a23)) ) || (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && (input == 4))) && (a1==3))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L966] COND FALSE !(((a1==3) && (((a26==1) && ( 441 < a12 && (!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))))) && (a19==12)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L972] COND FALSE !((((a1==3) && ( a12 <= 178 && (((input == 2) && ((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) || ((a19==11) && ((95 < a23) && (264 >= a23)) ))) && !(a13==1)))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L978] COND FALSE !(((a26==1) && ((input == 2) && ((!(a13==1) && ((( 476 < a23 && 441 < a12 ) && (a1==2)) && (a19==13))) || (((a19==9) && ((a1==3) && ( a23 <= 95 && a12 <= 178 ))) && (a13==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L986] COND FALSE !((((((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==2)) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && (a19==12)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L993] COND FALSE !((((a19==13) && ((a13==1) && ((a1==3) && ((a26==1) && ( ((264 < a23) && (476 >= a23)) && (input == 5)))))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1000] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 4)) && (a19==12))) && (a26==1)) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1008] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && ((((( a23 <= 95 && (a19==10)) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9)))) && (input == 3)) && (a13==1)) && (a1==2))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1016] COND FALSE !((( a12 <= 178 && ((((input == 5) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))))) && (a13==1)) && (a26==1))) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1023] COND FALSE !(((a26==1) && ((a19==13) && ((((a1==3) && ((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && (a13==1)) && 441 < a12 )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1031] COND FALSE !(((((a26==1) && ((a13==1) && (((a19==13) && (input == 5)) && a23 <= 95 ))) && a12 <= 178 ) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1037] COND FALSE !(((((a26==1) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2)) && (a19==13)) && !(a13==1))) && (a1==3)) && 441 < a12 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1044] COND FALSE !(( 441 < a12 && (((a26==1) && ((((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ( a23 <= 95 && (a19==10))) && (input == 3)) && !(a13==1))) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] COND FALSE !(((((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a19==13)) && (a26==1)) && ((178 < a12) && (395 >= a12)) ) && (a1==2)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1058] COND FALSE !(((a1==3) && ((a13==1) && (( ((395 < a12) && (441 >= a12)) && ((input == 2) && ((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )))) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1065] COND FALSE !(((a1==3) && ((!(a13==1) && ( a12 <= 178 && (((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 6)))) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1072] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ( a23 <= 95 && (a19==9)))) || (!(a13==1) && ((a19==9) && ((95 < a23) && (264 >= a23)) ))) && (input == 3)) && (a1==2))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1079] COND FALSE !((((((a1==4) && ((input == 6) && (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && a12 <= 178 ) && (a13==1)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1085] COND FALSE !(((!(a13==1) && ((a19==11) && ( 441 < a12 && ((a1==3) && ((a26==1) && (input == 4)))))) && a23 <= 95 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1092] COND FALSE !((((a26==1) && ((a19==10) && ((!(a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && a12 <= 178 ))) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1097] COND FALSE !((((a1==3) && ((a26==1) && ( 441 < a12 && ((input == 3) && (( ((95 < a23) && (264 >= a23)) && (a19==10)) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))))))) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1104] COND FALSE !(( 441 < a12 && (((a26==1) && ((a19==12) && (((input == 3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && !(a13==1)))) && (a1==2)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1118] COND FALSE !((( 441 < a12 && ((a26==1) && ((((input == 5) && (a13==1)) && a23 <= 95 ) && (a19==13)))) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1126] COND FALSE !(((a26==1) && ( ((95 < a23) && (264 >= a23)) && ((a19==13) && (((a1==2) && (!(a13==1) && (input == 3))) && ((395 < a12) && (441 >= a12)) ))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1131] COND FALSE !((((((!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a1==2)) && 441 < a12 ) && (a19==9)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1139] COND FALSE !((((((((input == 4) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && (a13==1)) && (a19==10)) && (a26==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1147] COND FALSE !((((!(a13==1) && (((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 3)) && a12 <= 178 )) && (a26==1)) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !((((input == 5) && ((((a19==13) && (( 476 < a23 && 441 < a12 ) && (a1==2))) && !(a13==1)) || (((a19==9) && ((a1==3) && ( a12 <= 178 && a23 <= 95 ))) && (a13==1)))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1163] COND FALSE !((((a19==9) && (!(a13==1) && (((a26==1) && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1170] COND FALSE !(((( a12 <= 178 && ((((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1)) && (a19==11))) && (a13==1)) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1176] COND FALSE !(( 441 < a12 && (((!(a13==1) && ((a1==3) && ((input == 3) && (a19==11)))) && a23 <= 95 ) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1181] COND FALSE !((((a1==3) && ( ((395 < a12) && (441 >= a12)) && ((a19==11) && ( ((264 < a23) && (476 >= a23)) && ((input == 4) && (a13==1)))))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1188] COND FALSE !(((a26==1) && ((a1==2) && (!(a13==1) && (((a19==11) && ( ((178 < a12) && (395 >= a12)) && (input == 3))) && a23 <= 95 ))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1196] COND FALSE !(((a26==1) && (( ((395 < a12) && (441 >= a12)) && (((a1==3) && ( ((264 < a23) && (476 >= a23)) && (input == 6))) && (a19==11))) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1204] COND FALSE !(((a13==1) && ((((a1==4) && ((((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 6))) && a12 <= 178 ) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1218] COND FALSE !((((a1==3) && (((a19==12) && ((a26==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))))) && !(a13==1))) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1224] COND FALSE !(((!(a13==1) && ((((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 2)) && (a26==1)) && a12 <= 178 )) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1231] COND FALSE !((!(a13==1) && ( ((264 < a23) && (476 >= a23)) && (((a26==1) && (((a19==10) && (input == 5)) && (a1==2))) && 441 < a12 )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1238] COND FALSE !(((a1==3) && ((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 2))) && (a19==13)) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1245] COND FALSE !((((a1==2) && (((a26==1) && (((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ((a19==10) && ((95 < a23) && (264 >= a23)) )) && (input == 6))) && !(a13==1))) && 441 < a12 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1251] COND FALSE !(((a1==3) && ((((((((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 5)) && (a26==1)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !((((a1==3) && ((((a19==10) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ) && (input == 3))) && (a26==1)) && 441 < a12 )) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((input == 2) && (((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )))) && (a1==3))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1273] COND FALSE !(( a12 <= 178 && ((a1==3) && ((a13==1) && (((( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12)))) && (input == 6)) && (a26==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1281] COND FALSE !(((a19==9) && ((a26==1) && (((((a1==4) && (input == 4)) && a23 <= 95 ) && a12 <= 178 ) && (a13==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1293] COND FALSE !(((!(a13==1) && (((a19==11) && (( a23 <= 95 && (input == 6)) && ((178 < a12) && (395 >= a12)) )) && (a26==1))) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1300] COND FALSE !(((a1==2) && ((!(a13==1) && ((a19==13) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3))))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1308] COND FALSE !(( 476 < a23 && ((a1==3) && (((((input == 2) && ((395 < a12) && (441 >= a12)) ) && (a13==1)) && (a19==12)) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1315] COND FALSE !((((a19==9) && (((((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a26==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) )) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1322] COND FALSE !((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((((input == 6) && (((a19==13) && a23 <= 95 ) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 )))) && (a1==2)) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1329] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a26==1) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)) && (a13==1)) && (a19==10)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1335] COND FALSE !(((((a13==1) && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ((a19==12) && a23 <= 95 )))) && (a1==3))) && (a26==1)) && a12 <= 178 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1340] COND FALSE !(((a19==11) && ((a26==1) && ((!(a13==1) && (((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && ((395 < a12) && (441 >= a12)) )) && (a1==2))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1347] COND FALSE !(((a1==4) && (((a26==1) && ( a12 <= 178 && ((( 476 < a23 && (a19==11)) || ((a19==12) && a23 <= 95 )) && (input == 5)))) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1353] COND FALSE !(( 441 < a12 && ((a19==13) && (!(a13==1) && ((((input == 4) && (a1==3)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1364] COND FALSE !(((a1==2) && ((a26==1) && ((!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a19==9))) && ((178 < a12) && (395 >= a12)) )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1370] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==3) && (((( a23 <= 95 && (a19==10)) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9)))) && (input == 5)) && (a13==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1377] COND FALSE !(((((((a26==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a13==1)) && (a19==12)) && (a1==2)) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1384] COND FALSE !(((( a12 <= 178 && ((a1==3) && ((a19==11) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))))) && !(a13==1)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1394] COND FALSE !(( 441 < a12 && (((((input == 2) && (((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9))))) && !(a13==1)) && (a26==1)) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1400] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((((a13==1) && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==11)) && (a1==2))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1406] COND FALSE !(((a13==1) && (((a26==1) && (( ((395 < a12) && (441 >= a12)) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==2))) && (a19==12)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1414] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((((input == 5) && (((((a19==13) && ((264 < a23) && (476 >= a23)) ) && (a13==1)) || (( 476 < a23 && (a19==13)) && (a13==1))) || (((a19==9) && a23 <= 95 ) && !(a13==1)))) && (a1==3)) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1421] COND FALSE !(((((((( a23 <= 95 && (a19==13)) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 ))) && (input == 5)) && !(a13==1)) && a12 <= 178 ) && (a1==3)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1427] COND FALSE !(((a19==13) && (((a26==1) && (!(a13==1) && ( ((95 < a23) && (264 >= a23)) && ((a1==3) && (input == 4))))) && a12 <= 178 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1434] COND FALSE !((!(a13==1) && (((a19==11) && (((a1==2) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a26==1))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1442] COND FALSE !(((a1==4) && ( a12 <= 178 && ((a26==1) && (((((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ((a19==9) && 476 < a23 ))) && (input == 5)) && !(a13==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1457] COND FALSE !(((( ((95 < a23) && (264 >= a23)) && ((((a19==10) && (input == 3)) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) && (a13==1)) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1463] COND FALSE !(( 441 < a12 && ((((a26==1) && (((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ((a19==10) && 476 < a23 )) || ((a19==11) && a23 <= 95 )) && (input == 6))) && (a13==1)) && (a1==2)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1470] COND FALSE !((((a1==2) && (((((input == 6) && (a26==1)) && 441 < a12 ) && a23 <= 95 ) && (a19==13))) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1478] COND FALSE !(((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a19==12) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && (a1==3))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1485] COND FALSE !((( ((178 < a12) && (395 >= a12)) && (((!(a13==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5))) && (a19==12)) && (a26==1))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1489] COND FALSE !(((((a26==1) && (( a23 <= 95 && ((input == 2) && a12 <= 178 )) && (a13==1))) && (a19==9)) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1495] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a1==2) && ((a26==1) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && !(a13==1)) && (a19==10)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1503] COND FALSE !(( 441 < a12 && ((a26==1) && ((a1==2) && ((a19==12) && ((( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 5)) && !(a13==1))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1511] COND FALSE !(((a1==3) && ( ((395 < a12) && (441 >= a12)) && (((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 2)) && (a26==1))) && (a19==9))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1518] COND FALSE !(((a1==2) && ( ((264 < a23) && (476 >= a23)) && ((a19==10) && (( 441 < a12 && ((a26==1) && (input == 6))) && !(a13==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1525] COND FALSE !((( a12 <= 178 && (((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1)) && (a19==9)) && !(a13==1))) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1538] COND FALSE !((((((((input == 5) && (a1==3)) && (a19==9)) && (a26==1)) && 476 < a23 ) && (a13==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1545] COND FALSE !(((a1==3) && ((( 476 < a23 && ((a19==11) && ((a26==1) && (input == 4)))) && ((395 < a12) && (441 >= a12)) ) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1552] COND FALSE !((( ((264 < a23) && (476 >= a23)) && (((((a19==9) && (input == 3)) && (a1==2)) && 441 < a12 ) && !(a13==1))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1559] COND FALSE !(( 441 < a12 && (!(a13==1) && ((a1==2) && ((a26==1) && ((input == 3) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1567] COND FALSE !(((a1==4) && ((((a26==1) && ((a19==12) && ((input == 5) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))))) && (a13==1)) && a12 <= 178 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (((a26==1) && ((a19==13) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a1==3)))) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1586] COND FALSE !(((a13==1) && ( a12 <= 178 && (((a26==1) && ((a1==3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)))) && (a19==11))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(((((a26==1) && ((a1==3) && ((a19==9) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3))))) && ((395 < a12) && (441 >= a12)) ) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1599] COND FALSE !(((a26==1) && ((( ((95 < a23) && (264 >= a23)) && (((input == 6) && !(a13==1)) && (a1==3))) && (a19==13)) && a12 <= 178 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1602] COND FALSE !(((a26==1) && (!(a13==1) && ( a12 <= 178 && (((((a19==9) && 476 < a23 ) || ((a19==10) && a23 <= 95 )) && (input == 6)) && (a1==3)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1610] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((((a26==1) && (((input == 5) && (a1==3)) && (a19==10))) && a23 <= 95 ) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1613] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((((a19==11) && ((input == 3) && (a1==2))) && (a13==1)) && ((395 < a12) && (441 >= a12)) )) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1625] COND FALSE !(( a12 <= 178 && ((a13==1) && (((a1==3) && ((input == 6) && (((a19==11) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10)))))) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1632] COND FALSE !(((a13==1) && ((((((input == 6) && (a19==13)) && (a26==1)) && (a1==4)) && a23 <= 95 ) && a12 <= 178 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1644] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (((((a19==9) && (input == 2)) && (a1==3)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1650] COND FALSE !(((a1==2) && ((a26==1) && ((a19==11) && ( 441 < a12 && (((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1656] COND FALSE !((((((((input == 6) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1)) && (a13==1)) && a12 <= 178 ) && (a1==3)) && (a19==10))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1662] COND FALSE !(((a26==1) && ((((a1==2) && ( 441 < a12 && ((input == 3) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))) && !(a13==1)) && (a19==13)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1668] COND FALSE !((!(a13==1) && ((a26==1) && (((a1==2) && (((a19==11) && (input == 2)) && ((95 < a23) && (264 >= a23)) )) && ((178 < a12) && (395 >= a12)) )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1680] COND FALSE !(((a19==9) && (( 441 < a12 && ((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==2)) && !(a13==1))) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1688] COND FALSE !(((!(a13==1) && ((a19==11) && ( 441 < a12 && (((input == 4) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && (a1==3))))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1695] COND FALSE !((((input == 4) && (((((a1==2) && ( 476 < a23 && 441 < a12 )) && (a19==13)) && !(a13==1)) || ((a13==1) && ((a19==9) && ((a1==3) && ( a23 <= 95 && a12 <= 178 )))))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1703] COND FALSE !(((((a13==1) && (((a1==3) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a26==1))) && (a19==10)) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1710] COND FALSE !(((a1==2) && (((((a13==1) && ((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && (a19==12)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1717] COND FALSE !((( a23 <= 95 && (((((input == 2) && (a13==1)) && (a1==4)) && a12 <= 178 ) && (a26==1))) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1724] COND FALSE !(((a19==13) && ((a26==1) && ( ((395 < a12) && (441 >= a12)) && ( ((264 < a23) && (476 >= a23)) && (!(a13==1) && ((a1==2) && (input == 5)))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1731] COND FALSE !(((a26==1) && ((a1==3) && (((a13==1) && (((a19==10) && (input == 5)) && ((95 < a23) && (264 >= a23)) )) && ((178 < a12) && (395 >= a12)) )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1738] COND FALSE !(((a1==3) && (( 441 < a12 && (!(a13==1) && ((input == 5) && (( 476 < a23 && (a19==12)) || ((a19==13) && a23 <= 95 ))))) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1753] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (!(a13==1) && ((a26==1) && ((a1==2) && ((a19==12) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1760] COND FALSE !((((a26==1) && ((a1==3) && ((((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && ((178 < a12) && (395 >= a12)) ) && (a19==11)))) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1769] COND FALSE !((!(a13==1) && ((( 441 < a12 && (((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3))) && (a19==9)) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1782] COND FALSE !(((((a26==1) && (((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5)) && a12 <= 178 ) && (a1==3))) && !(a13==1)) && (a19==9))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1785] COND FALSE !(((a26==1) && (((!(a13==1) && ((a1==3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)))) && ((395 < a12) && (441 >= a12)) ) && (a19==10)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1791] COND FALSE !(((a1==3) && (((((input == 3) && (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && 441 < a12 ) && !(a13==1)) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1805] COND FALSE !(((!(a13==1) && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)) && (a19==12)) && 441 < a12 ) && (a26==1))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1817] COND FALSE !((((a1==2) && ((((a26==1) && ( ((395 < a12) && (441 >= a12)) && (input == 6))) && (a19==13)) && ((264 < a23) && (476 >= a23)) )) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1824] COND FALSE !(((a1==3) && (((((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && (a13==1)) && 441 < a12 ) && (a26==1)) && (a19==11)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1830] COND FALSE !((((( ((395 < a12) && (441 >= a12)) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)))) && (a13==1)) && (a19==11)) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1836] COND FALSE !((((a1==4) && ((a13==1) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)) && (a19==13)) && (a26==1)))) && a12 <= 178 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1848] COND FALSE !(((!(a13==1) && ( 441 < a12 && ((a19==13) && (((a26==1) && (input == 2)) && (a1==2))))) && a23 <= 95 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1855] COND FALSE !(( 441 < a12 && ((((a13==1) && (((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a19==9))) && (a26==1)) && (a1==2)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1870] COND FALSE !((((( ((395 < a12) && (441 >= a12)) && ((input == 5) && ((( 476 < a23 && (a19==12)) || ( a23 <= 95 && (a19==13))) || ((a19==13) && ((95 < a23) && (264 >= a23)) )))) && (a26==1)) && !(a13==1)) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1877] COND FALSE !((((a19==12) && (( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 2)) && (a1==3))) && (a13==1))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1889] COND FALSE !((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && (a13==1)) && (a19==10)) && ((395 < a12) && (441 >= a12)) )) && (a26==1))) [L1894] CALL, EXPR calculate_output2(input) [L1900] COND FALSE !(((a19==9) && ((a26==1) && (( 441 < a12 && (((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a13==1))) && (a1==3))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1911] COND FALSE !((((a1==3) && (!(a13==1) && (((a19==9) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2))) && ((395 < a12) && (441 >= a12)) ))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1918] COND FALSE !((!(a13==1) && ((((a26==1) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && (a19==13))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1925] COND FALSE !(((a26==1) && ( a23 <= 95 && (!(a13==1) && ((a19==10) && (( ((395 < a12) && (441 >= a12)) && (input == 2)) && (a1==3))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1931] COND FALSE !((((a19==13) && ((((a26==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && a12 <= 178 ) && (a1==3))) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1939] COND FALSE !(((a26==1) && (((a1==3) && ((input == 5) && (((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ( a23 <= 95 && (a19==9)))) || (((a19==9) && ((95 < a23) && (264 >= a23)) ) && !(a13==1))))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1946] COND FALSE !(( a12 <= 178 && (((a1==3) && ( ((95 < a23) && (264 >= a23)) && (((a19==10) && (input == 4)) && !(a13==1)))) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1952] COND FALSE !(((a1==2) && ( ((395 < a12) && (441 >= a12)) && ((((( ((95 < a23) && (264 >= a23)) && (a19==9)) && !(a13==1)) || ((( 476 < a23 && (a19==13)) && (a13==1)) || (!(a13==1) && ((a19==9) && a23 <= 95 )))) && (input == 6)) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1960] COND FALSE !(( a12 <= 178 && ((a1==4) && (((( ((95 < a23) && (264 >= a23)) && (input == 2)) && (a13==1)) && (a26==1)) && (a19==13))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1973] COND FALSE !((( a12 <= 178 && ((a1==4) && (((a13==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a26==1)))) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1986] COND FALSE !(( 476 < a23 && ((a13==1) && ((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==12))) && (a1==3)) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1993] COND FALSE !((!(a13==1) && ((a1==2) && ((a26==1) && ( ((264 < a23) && (476 >= a23)) && ((a19==12) && ((input == 5) && ((178 < a12) && (395 >= a12)) ))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2000] COND FALSE !(((a19==11) && ((( a12 <= 178 && ((a26==1) && ((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))) && (a13==1)) && (a1==4)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2007] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)) && (a1==3))) && (a19==13))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2014] COND FALSE !(((a13==1) && (((( ((95 < a23) && (264 >= a23)) && ((input == 5) && a12 <= 178 )) && (a1==4)) && (a26==1)) && (a19==9)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2026] COND FALSE !((((a26==1) && (((!(a13==1) && (( ((395 < a12) && (441 >= a12)) && 476 < a23 ) && (a19==13))) || ((a13==1) && (( a23 <= 95 && 441 < a12 ) && (a19==9)))) && (input == 6))) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2034] COND FALSE !((!(a13==1) && ((((a26==1) && ( 441 < a12 && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)))) && (a19==13)) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2042] COND FALSE !((((a1==4) && ( a12 <= 178 && ((a26==1) && ((((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))) && (input == 4))))) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2048] COND FALSE !((!(a13==1) && (((((input == 2) && (( ((95 < a23) && (264 >= a23)) && (a19==11)) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )))) && (a26==1)) && (a1==2)) && 441 < a12 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2063] COND FALSE !(((a13==1) && ((((a26==1) && ((input == 2) && (( a23 <= 95 && (a19==11)) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10)))))) && a12 <= 178 ) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2069] COND FALSE !((((((a26==1) && ((input == 5) && (((a19==11) && a23 <= 95 ) || (((a19==10) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==10)))))) && (a1==4)) && (a13==1)) && a12 <= 178 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2076] COND FALSE !(((a19==12) && ((( ((178 < a12) && (395 >= a12)) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a1==3))) && (a26==1)) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2082] COND FALSE !(((( 476 < a23 && (((a26==1) && ((input == 6) && (a19==10))) && !(a13==1))) && (a1==2)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2089] COND FALSE !((!(a13==1) && (((a26==1) && ((((input == 6) && ((264 < a23) && (476 >= a23)) ) && 441 < a12 ) && (a19==9))) && (a1==2)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2096] COND FALSE !(((((a1==3) && ((a26==1) && ((a19==11) && ( 441 < a12 && (input == 3))))) && a23 <= 95 ) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2103] COND FALSE !(((a19==13) && (((a13==1) && ((( a12 <= 178 && (input == 4)) && (a1==4)) && (a26==1))) && ((95 < a23) && (264 >= a23)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2108] COND FALSE !((((((a19==9) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && ((395 < a12) && (441 >= a12)) )) && (a13==1)) && (a26==1)) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2114] COND FALSE !((((a26==1) && (((input == 4) && (((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ((a19==9) && a23 <= 95 ))) || (!(a13==1) && ( ((95 < a23) && (264 >= a23)) && (a19==9))))) && ((178 < a12) && (395 >= a12)) )) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2121] COND FALSE !(( 441 < a12 && ((a13==1) && (( a23 <= 95 && ((a1==3) && ((a26==1) && (input == 2)))) && (a19==11))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2125] COND FALSE !(((a13==1) && (( 441 < a12 && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && (a1==3))) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2138] COND FALSE !((( ((395 < a12) && (441 >= a12)) && (((a19==9) && ((a26==1) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))) && !(a13==1))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2145] COND FALSE !((((((a1==3) && (((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1))) && (a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a19==11))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2153] COND FALSE !((((a1==3) && ((a19==13) && ((!(a13==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && ((395 < a12) && (441 >= a12)) ))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2159] COND FALSE !(((a26==1) && ( a12 <= 178 && ((a1==3) && (!(a13==1) && ((input == 6) && (((a19==13) && a23 <= 95 ) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2165] COND FALSE !(((a19==9) && ((a26==1) && ((a1==3) && (((a13==1) && (( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 3))) && a12 <= 178 ))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2170] COND FALSE !((((a13==1) && ((a1==2) && (((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4)) && ((395 < a12) && (441 >= a12)) ) && (a26==1)))) && (a19==9))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2177] COND FALSE !(((a1==2) && ((((((input == 5) && ((264 < a23) && (476 >= a23)) ) && 441 < a12 ) && !(a13==1)) && (a26==1)) && (a19==9)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2184] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a1==2) && (((((((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9))) || ( a23 <= 95 && (a19==10))) && (input == 2)) && (a26==1)) && (a13==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2191] COND FALSE !((((a26==1) && (((a1==2) && ((a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)))) && (a19==12))) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2207] COND FALSE !(((a26==1) && (((a13==1) && ((((input == 5) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) )) && (a19==12)) && 441 < a12 )) && (a1==2)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2215] COND FALSE !(((a19==11) && ( ((178 < a12) && (395 >= a12)) && ((a26==1) && (( ((95 < a23) && (264 >= a23)) && ((input == 6) && (a1==2))) && !(a13==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2221] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (!(a13==1) && ((a19==12) && ((((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a26==1)) && (a1==3)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2228] COND FALSE !(( a23 <= 95 && ((a26==1) && ((a1==2) && ((a13==1) && ( ((395 < a12) && (441 >= a12)) && ((a19==11) && (input == 6)))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2235] COND FALSE !((!(a13==1) && (((a1==3) && ((((input == 2) && ( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && (a26==1)) && (a19==10))) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2241] COND FALSE !((((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==12)) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13)))))) && (a26==1)) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2247] COND FALSE !(((a1==3) && ( a12 <= 178 && ((a19==11) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 2)) && (a26==1)) && (a13==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2259] COND FALSE !((((a19==12) && ((a26==1) && ( 441 < a12 && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ) && (input == 4)) && !(a13==1))))) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2274] COND FALSE !((( 441 < a12 && ((a19==13) && (((a26==1) && ((input == 3) && (a13==1))) && a23 <= 95 ))) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2281] COND FALSE !(( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a19==12) && ((a13==1) && (((input == 4) && (a26==1)) && (a1==3))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2289] COND FALSE !((( a12 <= 178 && (!(a13==1) && ((a26==1) && ((a1==4) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 6)))))) && (a19==11))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2302] COND FALSE !(((a1==3) && ((a26==1) && ((( ((178 < a12) && (395 >= a12)) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && !(a13==1)) && (a19==12))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2308] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a1==3)) && (a13==1)) && (a19==11)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2315] COND FALSE !(((a1==3) && (((a13==1) && (( 441 < a12 && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==10))) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2322] COND FALSE !(((a19==9) && ((((a26==1) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && ((178 < a12) && (395 >= a12)) )) && !(a13==1)) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2329] COND FALSE !((((a1==4) && (((a19==10) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && a12 <= 178 )) && (a26==1))) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2344] COND FALSE !(((a13==1) && ((((a26==1) && ((input == 3) && (( a23 <= 95 && (a19==11)) || (((a19==10) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==10)))))) && a12 <= 178 ) && (a1==4)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2357] COND FALSE !((((a19==10) && ((a26==1) && ((!(a13==1) && ((input == 6) && (a1==3))) && ((264 < a23) && (476 >= a23)) ))) && a12 <= 178 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2363] COND FALSE !(((((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11)))) && (input == 2)) && !(a13==1)) && (a26==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2369] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==11) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)) && (a1==3))) && !(a13==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2377] COND FALSE !((((((((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ) && (input == 4)) && (a26==1)) && (a19==13)) && (a1==3)) && 441 < a12 ) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2391] COND FALSE !((!(a13==1) && ((a26==1) && ( 441 < a12 && ((a1==2) && ((a19==13) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 2)))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2397] COND FALSE !(((a26==1) && (( ((178 < a12) && (395 >= a12)) && (((( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11))) && (input == 3)) && !(a13==1))) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2405] COND FALSE !(((!(a13==1) && ((a1==3) && ((((input == 6) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && (a26==1)) && 441 < a12 ))) && (a19==10))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2413] COND FALSE !((((a26==1) && ((((( 476 < a23 && ((395 < a12) && (441 >= a12)) ) && (a19==13)) && !(a13==1)) || ((a13==1) && (( 441 < a12 && a23 <= 95 ) && (a19==9)))) && (input == 4))) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2421] COND FALSE !((((a1==3) && (((a26==1) && ((a19==11) && ((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))) && (a13==1))) && a12 <= 178 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2424] COND FALSE !(((a19==13) && (( ((178 < a12) && (395 >= a12)) && (((a13==1) && ((input == 4) && ((264 < a23) && (476 >= a23)) )) && (a26==1))) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2431] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a19==10) && ((a26==1) && (( 476 < a23 && ((a1==2) && (input == 5))) && !(a13==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2438] COND FALSE !(((!(a13==1) && (( ((395 < a12) && (441 >= a12)) && (((a26==1) && (input == 4)) && (a19==11))) && 476 < a23 )) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2446] COND FALSE !((((a19==9) && ((a13==1) && (((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6)) && (a26==1)) && ((395 < a12) && (441 >= a12)) ))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2452] COND FALSE !(((a1==2) && ((((a26==1) && ((a13==1) && ((input == 2) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )))) && (a19==12)) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2459] COND FALSE !((((((a19==11) && ((a26==1) && ((input == 2) && (a1==3)))) && ((264 < a23) && (476 >= a23)) ) && !(a13==1)) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2466] COND FALSE !(((( a12 <= 178 && ((a1==3) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 5)))) && (a26==1)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2472] COND FALSE !(((((((((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )) && (input == 5)) && !(a13==1)) && (a26==1)) && ((178 < a12) && (395 >= a12)) ) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2480] COND FALSE !(((( 476 < a23 && ( a12 <= 178 && ((a1==3) && ((input == 5) && (a13==1))))) && (a26==1)) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2487] COND FALSE !(((a1==3) && (((a19==11) && ((a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && (a26==1)))) && a12 <= 178 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2499] COND FALSE !((((a26==1) && ((a13==1) && ((a1==2) && ( ((395 < a12) && (441 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 5)))))) && (a19==9))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2506] COND FALSE !((!(a13==1) && ((((a1==2) && ((input == 6) && ((((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 )) || ((a19==13) && ((95 < a23) && (264 >= a23)) )))) && (a26==1)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2512] COND FALSE !(((((input == 3) && ((((a19==13) && ( 476 < a23 && ((395 < a12) && (441 >= a12)) )) && !(a13==1)) || ((a13==1) && (( a23 <= 95 && 441 < a12 ) && (a19==9))))) && (a1==2)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2520] COND FALSE !((((a19==11) && (((( ((395 < a12) && (441 >= a12)) && (input == 5)) && (a26==1)) && !(a13==1)) && (a1==3))) && ((264 < a23) && (476 >= a23)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2527] COND FALSE !(((a26==1) && (((a19==11) && ((a13==1) && (((input == 2) && (a1==2)) && a23 <= 95 ))) && ((395 < a12) && (441 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2532] COND FALSE !(((((a26==1) && ( 441 < a12 && ((( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 5)) && (a1==3)))) && (a19==10)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2538] COND FALSE !(((a1==3) && ((((a19==10) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 5)) && a12 <= 178 )) && (a26==1)) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2543] COND FALSE !(((((a13==1) && (((a19==13) && ((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && a12 <= 178 )) && (a26==1)) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2549] COND FALSE !(((a13==1) && (((a19==11) && (((a26==1) && ((input == 2) && ((95 < a23) && (264 >= a23)) )) && ((395 < a12) && (441 >= a12)) )) && (a1==2)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2556] COND FALSE !((((a26==1) && ((a13==1) && ((((input == 5) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==9)))) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2562] COND FALSE !(( a12 <= 178 && (((a1==4) && ((((input == 5) && (a26==1)) && !(a13==1)) && (a19==10))) && 476 < a23 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2569] COND FALSE !(((a26==1) && (((!(a13==1) && (((((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))) && (input == 5))) && ((178 < a12) && (395 >= a12)) ) && (a1==2)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2576] COND FALSE !(((a19==11) && ((a1==4) && (((((input == 5) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && a12 <= 178 ) && (a26==1)) && (a13==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2579] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==3) && (((input == 6) && (( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ((a19==9) && 476 < a23 )))) && (a26==1))) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2586] COND FALSE !(((a1==4) && ( a12 <= 178 && ((((a26==1) && (( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 4))) && (a19==12)) && (a13==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] COND FALSE !((( a12 <= 178 && (!(a13==1) && ((((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a1==4)) && (a26==1)))) && (a19==10))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2611] COND FALSE !((( a12 <= 178 && ((a1==4) && ((a26==1) && ((a19==9) && ((input == 2) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )))))) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2624] COND FALSE !((((a26==1) && ((((((a19==12) && 476 < a23 ) || ( a23 <= 95 && (a19==13))) && (input == 6)) && 441 < a12 ) && (a1==3))) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2638] COND FALSE !((((((a19==12) && ( ((178 < a12) && (395 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6)))) && (a26==1)) && (a1==3)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2645] COND FALSE !(((a1==2) && (((( ((178 < a12) && (395 >= a12)) && ((input == 3) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && (a19==9)) && !(a13==1)) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2650] COND FALSE !((((a19==13) && ((a26==1) && ((((a13==1) && (input == 6)) && ((95 < a23) && (264 >= a23)) ) && a12 <= 178 ))) && (a1==4))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2657] COND FALSE !(((a1==2) && ( ((178 < a12) && (395 >= a12)) && (((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && !(a13==1))) && (a19==12))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2663] COND FALSE !(((a19==10) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a13==1) && (( ((95 < a23) && (264 >= a23)) && (input == 5)) && (a26==1))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2670] COND FALSE !(((( ((395 < a12) && (441 >= a12)) && ( ((95 < a23) && (264 >= a23)) && (((a26==1) && (input == 6)) && (a1==3)))) && (a13==1)) && (a19==10))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2677] COND FALSE !(((!(a13==1) && ((a1==4) && ( a12 <= 178 && (((input == 3) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1))))) && (a19==10))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2692] COND FALSE !(((a26==1) && ((((input == 6) && ((((a19==9) && ((95 < a23) && (264 >= a23)) ) && !(a13==1)) || ((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ( a23 <= 95 && (a19==9)))))) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2700] COND FALSE !(((a19==12) && ( ((395 < a12) && (441 >= a12)) && (((a1==2) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)) && !(a13==1))) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2708] COND FALSE !((((a13==1) && ( ((395 < a12) && (441 >= a12)) && (((a19==9) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3))) && (a1==2)))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2715] COND FALSE !((( ((178 < a12) && (395 >= a12)) && ((!(a13==1) && (((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==10))) && (input == 4))) && (a1==2))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2726] COND FALSE !((!(a13==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 4)) && (a1==3)) && a12 <= 178 ) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2733] COND FALSE !(((((!(a13==1) && ((a26==1) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))))) && (a1==3)) && ((395 < a12) && (441 >= a12)) ) && (a19==12))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2739] COND FALSE !(( a12 <= 178 && ((a19==10) && (((a26==1) && (((input == 2) && ((264 < a23) && (476 >= a23)) ) && (a1==3))) && !(a13==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2744] COND FALSE !((((((a1==2) && ((a19==9) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6)))) && (a26==1)) && ((395 < a12) && (441 >= a12)) ) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2751] COND FALSE !((((a26==1) && ((a13==1) && ( 441 < a12 && ((a19==13) && ((input == 5) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))))))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2758] COND FALSE !(((( 441 < a12 && ((a1==3) && ((input == 5) && (( ((95 < a23) && (264 >= a23)) && (a19==10)) || (( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))))))) && (a13==1)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2769] COND FALSE !(((a1==2) && ((((((input == 4) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a26==1)) && 441 < a12 ) && (a19==13)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2776] COND FALSE !((((a13==1) && ( ((395 < a12) && (441 >= a12)) && ((a26==1) && ( ((264 < a23) && (476 >= a23)) && ((input == 3) && (a19==11)))))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2781] COND FALSE !((((((((input == 2) && (a13==1)) && ((264 < a23) && (476 >= a23)) ) && ((395 < a12) && (441 >= a12)) ) && (a1==3)) && (a26==1)) && (a19==11))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2787] COND FALSE !(((a19==13) && ((a1==3) && ( ((178 < a12) && (395 >= a12)) && ( ((264 < a23) && (476 >= a23)) && ((a13==1) && ((input == 6) && (a26==1)))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2798] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (((a1==2) && ((a26==1) && ((input == 2) && ((((a19==9) && 476 < a23 ) || ((a19==10) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==10)))))) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2803] COND FALSE !(((!(a13==1) && ((a19==10) && ((a26==1) && ( a12 <= 178 && ((a1==4) && (input == 2)))))) && 476 < a23 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2811] COND FALSE !(((a19==9) && ((a13==1) && (((((input == 5) && a12 <= 178 ) && (a1==4)) && a23 <= 95 ) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2818] COND FALSE !((((a13==1) && ((a1==4) && ((((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ((a19==9) && 476 < a23 )) || ((a19==10) && a23 <= 95 )) && (input == 2)) && a12 <= 178 ))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2825] COND FALSE !((( ((395 < a12) && (441 >= a12)) && (( 476 < a23 && ((!(a13==1) && (input == 5)) && (a19==11))) && (a26==1))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2833] COND FALSE !(( 441 < a12 && ((a13==1) && ((((a1==2) && ((input == 4) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ))) && (a19==12)) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2847] COND FALSE !((!(a13==1) && ((a19==12) && ((a26==1) && ((((input == 5) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2851] COND FALSE !(((a26==1) && (((((( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (input == 6)) && (a13==1)) && (a19==9)) && a12 <= 178 ) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2857] COND FALSE !(((a1==2) && ((( 441 < a12 && (( ((95 < a23) && (264 >= a23)) && (input == 3)) && (a19==11))) && (a13==1)) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2864] COND FALSE !(((((a1==2) && ((a26==1) && (((input == 2) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a19==9)))) && (a13==1)) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2871] COND FALSE !((((a1==2) && (((a26==1) && ((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 3)))) && (a19==13))) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2884] COND FALSE !(((a1==2) && ((((((((a19==9) && ((264 < a23) && (476 >= a23)) ) || ((a19==9) && 476 < a23 )) || ((a19==10) && a23 <= 95 )) && (input == 6)) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2890] COND FALSE !(((a19==11) && (((a26==1) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 ) && (a1==2))) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2896] COND FALSE !(((a26==1) && (( ((395 < a12) && (441 >= a12)) && ((((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && !(a13==1)) && (a19==13))) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2899] COND FALSE !((((a26==1) && ((( ((395 < a12) && (441 >= a12)) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 3))) && !(a13==1)) && (a19==12))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2906] COND FALSE !((((a1==3) && (( a12 <= 178 && (( ((95 < a23) && (264 >= a23)) && (input == 6)) && (a26==1))) && (a19==10))) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2912] COND FALSE !((((((((((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 )) || ((a19==13) && ((95 < a23) && (264 >= a23)) )) && (input == 3)) && (a26==1)) && ((178 < a12) && (395 >= a12)) ) && !(a13==1)) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2918] COND FALSE !((((((a26==1) && ( 441 < a12 && ( a23 <= 95 && (input == 4)))) && (a13==1)) && (a1==3)) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2921] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((((((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a26==1)) && (a1==2)) && !(a13==1)) && (a19==11)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2929] COND FALSE !(( a12 <= 178 && (((a19==12) && (((a26==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a1==3))) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2941] COND FALSE !(((a13==1) && ((a1==2) && ((a19==13) && ((((input == 5) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && 441 < a12 ) && (a26==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2944] COND FALSE !(((!(a13==1) && (((((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ((a19==9) && 476 < a23 )) || ((a19==10) && a23 <= 95 )) && (input == 6)) && (a26==1)) && ((395 < a12) && (441 >= a12)) )) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2951] COND FALSE !((((a19==13) && ((a26==1) && ((!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && ((178 < a12) && (395 >= a12)) ))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2957] COND FALSE !(((((a19==11) && ((((input == 5) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && !(a13==1)) && (a26==1))) && 441 < a12 ) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2972] COND FALSE !((!(a13==1) && ((a1==2) && ((a19==13) && ((((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a26==1)) && ((178 < a12) && (395 >= a12)) ))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2976] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==10) && ((a26==1) && ( a23 <= 95 && ((input == 4) && !(a13==1)))))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2983] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==13) && ((((input == 4) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) )) && (a13==1)) && (a26==1)))) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2990] COND FALSE !((((a1==3) && ((a26==1) && ((a19==10) && ((a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 3)))))) && a12 <= 178 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2996] COND FALSE !((!(a13==1) && ((a26==1) && ((a1==2) && ((a19==12) && ( ((395 < a12) && (441 >= a12)) && ((input == 6) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3010] COND FALSE !((!(a13==1) && (( ((264 < a23) && (476 >= a23)) && ((a1==3) && (((input == 2) && (a26==1)) && (a19==12)))) && 441 < a12 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3017] COND FALSE !((((a13==1) && ( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((input == 6) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && (a1==2))))) && (a19==10))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3024] COND FALSE !((((((((input == 2) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && ((395 < a12) && (441 >= a12)) ) && (a1==2)) && (a26==1)) && (a19==10)) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3030] COND FALSE !(( ((95 < a23) && (264 >= a23)) && ((a13==1) && (((a1==4) && ( a12 <= 178 && ((a26==1) && (input == 3)))) && (a19==10))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3035] COND FALSE !(((a26==1) && ( 441 < a12 && ((a19==12) && ((a13==1) && ( 476 < a23 && ((a1==2) && (input == 4)))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3041] COND FALSE !((( a12 <= 178 && ((a26==1) && ((a13==1) && (((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && (a1==4))))) && (a19==12))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3056] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a13==1) && (((a1==3) && (((input == 5) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1))) && (a19==11))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3063] COND FALSE !((((a13==1) && ((a1==3) && ((a26==1) && ((input == 3) && ((( 476 < a23 && (a19==11)) || ( a23 <= 95 && (a19==12))) || ( ((95 < a23) && (264 >= a23)) && (a19==12))))))) && 441 < a12 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3076] COND FALSE !((((( ((95 < a23) && (264 >= a23)) && (!(a13==1) && ((a1==2) && (input == 5)))) && (a26==1)) && (a19==11)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3086] COND FALSE !(( a12 <= 178 && (((((a1==4) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a19==9)) && !(a13==1)) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3099] COND FALSE !(((a1==3) && ((((a26==1) && (((input == 6) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) )) && 441 < a12 )) && (a13==1)) && (a19==9)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3113] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a26==1) && (!(a13==1) && ((((a19==13) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==12)) || ( a23 <= 95 && (a19==13)))) && (input == 3))))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3120] COND FALSE !(((a1==4) && ( a12 <= 178 && ((a13==1) && ((a26==1) && (((input == 3) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && (a19==12))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3127] COND FALSE !((!(a13==1) && ((a1==2) && ( ((178 < a12) && (395 >= a12)) && ((a26==1) && ((( ((95 < a23) && (264 >= a23)) && (a19==10)) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 6))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3134] COND FALSE !(( 476 < a23 && (((a19==12) && ((a26==1) && ((a1==2) && ( 441 < a12 && (input == 2))))) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3142] COND FALSE !(((a1==3) && ((a13==1) && ( ((395 < a12) && (441 >= a12)) && (((input == 3) && (((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ((a19==9) && 476 < a23 )))) && (a26==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3148] COND FALSE !(( a12 <= 178 && ((a19==12) && (!(a13==1) && (((a1==3) && ((input == 2) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && (a26==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3156] COND FALSE !(((a13==1) && ((a26==1) && ((a1==3) && ( a12 <= 178 && ((( ((95 < a23) && (264 >= a23)) && (a19==12)) || (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12)))) && (input == 6))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3168] COND FALSE !((!(a13==1) && (( ((264 < a23) && (476 >= a23)) && ((a19==12) && ((a26==1) && ( 441 < a12 && (input == 6))))) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3182] COND FALSE !(((a26==1) && ( ((95 < a23) && (264 >= a23)) && ((((a13==1) && ((a1==2) && (input == 4))) && 441 < a12 ) && (a19==11))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3185] COND FALSE !(((((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 2)) && (a26==1)) && (a1==3)) && !(a13==1)) && 441 < a12 ) && (a19==9))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3198] COND FALSE !(( a12 <= 178 && ((((a13==1) && ((input == 2) && ((((a19==10) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11))))) && (a26==1)) && (a1==4)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3210] COND FALSE !(((((((a26==1) && ((input == 3) && ( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )))) && (a1==3)) && !(a13==1)) && ((178 < a12) && (395 >= a12)) ) && (a19==10))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3217] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 3) && !(a13==1))) && (a19==13))) && ((395 < a12) && (441 >= a12)) ) && ((264 < a23) && (476 >= a23)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3225] COND FALSE !(((a19==10) && ((a1==3) && (( a12 <= 178 && (( ((95 < a23) && (264 >= a23)) && (input == 3)) && (a26==1))) && !(a13==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3232] COND FALSE !(((( a12 <= 178 && ((a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && (a19==11)))) && (a1==4)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3247] COND FALSE !(((((a19==11) && ((a26==1) && (((input == 4) && (a1==2)) && (a13==1)))) && ((95 < a23) && (264 >= a23)) ) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3253] COND FALSE !(((( ((178 < a12) && (395 >= a12)) && ((a19==11) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && (a26==1)))) && (a1==2)) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3259] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a1==3) && (((((((a19==13) && 476 < a23 ) && (a13==1)) || (((a19==9) && a23 <= 95 ) && !(a13==1))) || (((a19==9) && ((95 < a23) && (264 >= a23)) ) && !(a13==1))) && (input == 2)) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3266] COND FALSE !(((a19==9) && ((a13==1) && ((a1==3) && ((a26==1) && ( a12 <= 178 && ((input == 5) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3271] COND FALSE !(((a26==1) && ((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((input == 4) && ((((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9))) || ( a23 <= 95 && (a19==10)))))) && (a1==2)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3279] COND FALSE !(((a1==3) && ( 441 < a12 && ((a26==1) && (!(a13==1) && ((input == 2) && (( 476 < a23 && (a19==12)) || ( a23 <= 95 && (a19==13))))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3286] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (( ((95 < a23) && (264 >= a23)) && ((((input == 3) && (a26==1)) && !(a13==1)) && (a19==11))) && (a1==3)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3292] COND FALSE !(((a1==4) && ( a12 <= 178 && ((a19==12) && ((a26==1) && (((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && (a13==1))))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3299] COND FALSE !(((((a13==1) && ((((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==10))) && (input == 5)) && (a1==2))) && 441 < a12 ) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3305] COND FALSE !(((a19==13) && ((a1==3) && ((( ((178 < a12) && (395 >= a12)) && ((input == 2) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && (a13==1)) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3311] COND FALSE !(((a13==1) && ((((a1==3) && ((a19==10) && ( a23 <= 95 && (input == 4)))) && (a26==1)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3316] COND FALSE !(((a19==12) && ((((a1==2) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2)) && ((395 < a12) && (441 >= a12)) )) && (a13==1)) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3324] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 3)) && (a19==9)) && (a13==1)) && (a1==3))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3331] COND FALSE !(((a1==2) && ((a26==1) && ((((((a13==1) && ((a19==13) && 476 < a23 )) || (!(a13==1) && ((a19==9) && a23 <= 95 ))) || (( ((95 < a23) && (264 >= a23)) && (a19==9)) && !(a13==1))) && (input == 2)) && ((395 < a12) && (441 >= a12)) )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3339] COND FALSE !(((!(a13==1) && (((((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 5)) && (a1==2)) && (a26==1))) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3346] COND FALSE !(((((a1==3) && ( 441 < a12 && ((a13==1) && ((input == 2) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))) && (a26==1)) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3360] COND FALSE !((((a19==9) && (((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 2)) && (a26==1)) && (a13==1)) && (a1==3))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3366] COND FALSE !((( a12 <= 178 && ((a19==13) && ((a26==1) && (((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a1==3))))) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3373] COND FALSE !(((((( a12 <= 178 && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && !(a13==1)) && (a1==3)) && (a19==13)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3387] COND FALSE !(((a26==1) && (((a13==1) && ((a1==3) && (((input == 4) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) )) && (a19==9)))) && 441 < a12 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3395] COND FALSE !(((((a26==1) && ((!(a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 5))) && ((395 < a12) && (441 >= a12)) )) && (a1==3)) && (a19==12))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3403] COND FALSE !((((a19==11) && ((a26==1) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && (a13==1)) && (a1==3)))) && 441 < a12 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3410] COND FALSE !((((a26==1) && ((a13==1) && ((a1==3) && (( ((395 < a12) && (441 >= a12)) && (input == 6)) && (a19==12))))) && 476 < a23 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3415] COND FALSE !((((a1==3) && (( a12 <= 178 && ((input == 5) && (((a19==11) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10)))))) && (a26==1))) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3423] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a1==3) && (((!(a13==1) && ((a19==9) && a23 <= 95 )) || ((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || (( 476 < a23 && (a19==13)) && (a13==1)))) && (input == 3)))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3430] COND FALSE !((((((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a19==12)) && (a1==3)) && 441 < a12 ) && !(a13==1)) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3438] COND FALSE !((((((a19==12) && (!(a13==1) && ( ((264 < a23) && (476 >= a23)) && (input == 2)))) && (a1==2)) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3444] COND FALSE !(((a19==11) && (( 476 < a23 && (((a1==3) && ( ((395 < a12) && (441 >= a12)) && (input == 2))) && (a26==1))) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3450] COND FALSE !(((a19==9) && ( 441 < a12 && (((((input == 5) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a1==2)) && (a13==1)) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3457] COND FALSE !(((((a26==1) && ((a13==1) && (( ((95 < a23) && (264 >= a23)) && (input == 6)) && (a19==11)))) && ((395 < a12) && (441 >= a12)) ) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3465] COND FALSE !(((((a1==3) && (((a19==11) && ((input == 6) && !(a13==1))) && ((95 < a23) && (264 >= a23)) )) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3471] COND FALSE !(((a1==3) && ((a19==10) && ((!(a13==1) && ( a23 <= 95 && ((input == 5) && (a26==1)))) && ((395 < a12) && (441 >= a12)) )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3478] COND FALSE !(((!(a13==1) && (((((a26==1) && (input == 4)) && a23 <= 95 ) && 441 < a12 ) && (a1==2))) && (a19==13))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3485] COND FALSE !((((((a1==3) && (((input == 6) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) )) && (a26==1))) && !(a13==1)) && (a19==9)) && a12 <= 178 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3492] COND FALSE !(( a12 <= 178 && (((a26==1) && (((input == 4) && (( a23 <= 95 && (a19==11)) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ((a19==10) && 476 < a23 )))) && (a1==3))) && (a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3499] COND FALSE !(((a26==1) && ((((a1==3) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) && (input == 3))) && a12 <= 178 ) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3507] COND FALSE !((((!(a13==1) && ((a26==1) && ((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 5)))) && (a1==3)) && 441 < a12 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3521] COND FALSE !(((a13==1) && ((((a26==1) && ((a1==3) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))) && ((178 < a12) && (395 >= a12)) ) && (a19==12)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3529] COND FALSE !(((a26==1) && (((!(a13==1) && (((input == 3) && ((178 < a12) && (395 >= a12)) ) && (a1==2))) && (a19==11)) && ((95 < a23) && (264 >= a23)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3535] COND FALSE !(( ((178 < a12) && (395 >= a12)) && (((((a1==3) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 2))) && !(a13==1)) && (a26==1)) && (a19==13)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3541] COND FALSE !(((a1==2) && ((a13==1) && ((a26==1) && (((input == 2) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==10)))) && 441 < a12 ))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3549] COND FALSE !(( a23 <= 95 && ((( 441 < a12 && ((a19==13) && ((a1==2) && (input == 2)))) && (a13==1)) && (a26==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3556] COND FALSE !(((((a26==1) && ( ((264 < a23) && (476 >= a23)) && (((input == 4) && !(a13==1)) && ((178 < a12) && (395 >= a12)) ))) && (a19==12)) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3563] COND FALSE !(((a1==2) && ((( ((178 < a12) && (395 >= a12)) && (((input == 5) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a26==1))) && (a19==12)) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3570] COND FALSE !(((a26==1) && ((!(a13==1) && (((((a19==12) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==11)) || ((a19==12) && a23 <= 95 ))) && (input == 6)) && (a1==4))) && a12 <= 178 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3584] COND FALSE !((((((((a26==1) && (input == 6)) && (a1==4)) && 476 < a23 ) && (a19==10)) && a12 <= 178 ) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3591] COND FALSE !(((a26==1) && (!(a13==1) && (((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 4))) && 441 < a12 )))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3604] COND FALSE !(((a1==2) && (((a26==1) && ((((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))) && (a19==13)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3612] COND FALSE !(((a1==2) && (!(a13==1) && ( 441 < a12 && ((((((a19==11) && ((264 < a23) && (476 >= a23)) ) || ((a19==11) && 476 < a23 )) || ( a23 <= 95 && (a19==12))) && (input == 6)) && (a26==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3620] COND FALSE !((((a1==3) && ((a13==1) && ( a12 <= 178 && ((a19==13) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)))))) && (a26==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3625] COND FALSE !(((a1==3) && (!(a13==1) && (((a26==1) && ( a12 <= 178 && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4)))) && (a19==12))))) [L3629] CALL, EXPR calculate_output3(input) [L3635] COND FALSE !(( 441 < a12 && ((a1==2) && ((a19==10) && ((!(a13==1) && ( ((264 < a23) && (476 >= a23)) && (input == 2))) && (a26==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3648] COND FALSE !(((!(a13==1) && ((a19==10) && ((((a26==1) && (input == 5)) && (a1==2)) && ((178 < a12) && (395 >= a12)) ))) && ((264 < a23) && (476 >= a23)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3653] COND FALSE !((((( 441 < a12 && ((input == 5) && (( ((95 < a23) && (264 >= a23)) && (a19==11)) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))))) && !(a13==1)) && (a26==1)) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3660] COND FALSE !((((((((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && 441 < a12 ) && (a26==1)) && (a1==2)) && (a13==1)) && (a19==11))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3667] COND FALSE !(((a13==1) && (((a26==1) && ((a1==3) && ((input == 6) && ((((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))) || ( ((95 < a23) && (264 >= a23)) && (a19==12)))))) && 441 < a12 ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3681] COND FALSE !((!(a13==1) && ( a12 <= 178 && ((a1==4) && (((input == 4) && ((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ((a19==9) && 476 < a23 )) || ((a19==10) && a23 <= 95 ))) && (a26==1)))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3694] COND FALSE !(((a1==3) && (((( 476 < a23 && ((input == 4) && (a19==9))) && (a13==1)) && (a26==1)) && ((178 < a12) && (395 >= a12)) ))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3701] COND FALSE !((( 441 < a12 && ((a1==3) && ((a26==1) && ((input == 6) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9)))))))) && !(a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3717] COND FALSE !((( ((264 < a23) && (476 >= a23)) && (!(a13==1) && ((a19==13) && ((a26==1) && ( ((395 < a12) && (441 >= a12)) && (input == 2)))))) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3723] COND FALSE !((!(a13==1) && ((a19==11) && ((((a26==1) && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && ((178 < a12) && (395 >= a12)) ) && (a1==2))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3737] COND FALSE !(((a19==11) && ( a12 <= 178 && (((a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)) && (a1==3))) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3744] COND FALSE !((((a13==1) && (((a19==13) && (((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && (a26==1))) && (a1==2))) && 441 < a12 )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3752] COND FALSE !(((!(a13==1) && (((a1==2) && ((a19==11) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))) && (a26==1))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3758] COND FALSE !((((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((a1==2) && ((input == 4) && (a26==1))) && !(a13==1)))) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3765] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==2) && ((((a19==13) && (input == 5)) && ((95 < a23) && (264 >= a23)) ) && (a26==1))) && !(a13==1)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3772] COND FALSE !((((a19==10) && ( ((95 < a23) && (264 >= a23)) && ((((a26==1) && (input == 2)) && (a13==1)) && ((178 < a12) && (395 >= a12)) ))) && (a1==3))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3779] COND FALSE !((((((((((a19==10) && ((264 < a23) && (476 >= a23)) ) || ((a19==10) && 476 < a23 )) || ( a23 <= 95 && (a19==11))) && (input == 4)) && (a26==1)) && (a1==4)) && a12 <= 178 ) && (a13==1))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3787] COND FALSE !(( a12 <= 178 && (((a1==3) && ((a26==1) && ( ((264 < a23) && (476 >= a23)) && ((input == 5) && !(a13==1))))) && (a19==10)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3794] COND FALSE !((((((a26==1) && ((input == 2) && ((((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9))) || ( a23 <= 95 && (a19==10))))) && (a1==2)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3808] COND FALSE !(( ((95 < a23) && (264 >= a23)) && (( a12 <= 178 && ((((input == 6) && (a1==4)) && (a13==1)) && (a26==1))) && (a19==9)))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3815] COND FALSE !(((((a1==3) && (!(a13==1) && ((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) && (input == 6)))) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3822] COND FALSE !(( a23 <= 95 && ((a1==3) && (( 441 < a12 && (((a19==11) && (input == 5)) && !(a13==1))) && (a26==1))))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3827] COND FALSE !((((a13==1) && (( 441 < a12 && (((input == 5) && (a19==11)) && (a26==1))) && ((95 < a23) && (264 >= a23)) )) && (a1==2))) VAL [a12=420, a13=0, a19=13, a1=3, a23=176, a26=1, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3830] COND TRUE ( ((395 < a12) && (441 >= a12)) && ((((a26==1) && ((((a19==13) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==12)) || ((a19==13) && a23 <= 95 ))) && (input == 6))) && (a1==3)) && !(a13==1))) [L3831] a12 = ((((a12 / 5) + -207846) * 10)/ 9) [L3832] a23 = ((((a23 - 0) % 300047)- 299951) * 1) [L3833] a1 = 2 [L3834] a19 = 13 [L3836] return -1; VAL [\result=-1, a12=-230846, a13=0, a19=13, a1=2, a23=-299775, a26=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L3629] RET, EXPR calculate_output3(input) [L3629] return calculate_output3(input); [L1894] RET, EXPR calculate_output2(input) [L1894] return calculate_output2(input); [L5824] RET, EXPR calculate_output(input) [L5824] output = calculate_output(input) [L5819] int input; [L5820] input = __VERIFIER_nondet_int() [L5821] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5824] CALL calculate_output(input) [L39] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) VAL [a12=-230846, a13=0, a19=13, a1=2, a23=-299775, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) VAL [a12=-230846, a13=0, a19=13, a1=2, a23=-299775, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) VAL [a12=-230846, a13=0, a19=13, a1=2, a23=-299775, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) VAL [a12=-230846, a13=0, a19=13, a1=2, a23=-299775, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND TRUE ((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1)) VAL [a12=-230846, a13=0, a19=13, a1=2, a23=-299775, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] reach_error() VAL [a12=-230846, a13=0, a19=13, a1=2, a23=-299775, a26=1, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1098 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 208.3s, OverallIterations: 32, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 137.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33536 SdHoareTripleChecker+Valid, 114.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33536 mSDsluCounter, 36402 SdHoareTripleChecker+Invalid, 97.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4082 mSDsCounter, 16298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101643 IncrementalHoareTripleChecker+Invalid, 117941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16298 mSolverCounterUnsat, 32320 mSDtfsCounter, 101643 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5062 GetRequests, 4998 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249039occurred in iteration=31, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 242497 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 22768 NumberOfCodeBlocks, 22768 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 22345 ConstructedInterpolants, 0 QuantifiedInterpolants, 77388 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4866 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 37 InterpolantComputations, 30 PerfectInterpolantSequences, 24760/25852 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-12-02 14:22:21,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff401c2-e76f-4726-a3bb-a05f1c10f4bd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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