./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label09.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 7e1c4d2c7e091760d0cfd2192761696664946c8a36300f0a25d92c3977c93680 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 01:29:03,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 01:29:03,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 01:29:03,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 01:29:03,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 01:29:03,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 01:29:03,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 01:29:03,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 01:29:03,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 01:29:03,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 01:29:03,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 01:29:03,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 01:29:03,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 01:29:03,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 01:29:03,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 01:29:03,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 01:29:03,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 01:29:03,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 01:29:03,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 01:29:03,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 01:29:03,522 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 01:29:03,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 01:29:03,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 01:29:03,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 01:29:03,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 01:29:03,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 01:29:03,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 01:29:03,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 01:29:03,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 01:29:03,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 01:29:03,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 01:29:03,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 01:29:03,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 01:29:03,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 01:29:03,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 01:29:03,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 01:29:03,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 01:29:03,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 01:29:03,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 01:29:03,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 01:29:03,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 01:29:03,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 01:29:03,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 01:29:03,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 01:29:03,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 01:29:03,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 01:29:03,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 01:29:03,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 01:29:03,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 01:29:03,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 01:29:03,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 01:29:03,567 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 01:29:03,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 01:29:03,568 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 01:29:03,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 01:29:03,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 01:29:03,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 01:29:03,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 01:29:03,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 01:29:03,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 01:29:03,569 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 01:29:03,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 01:29:03,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 01:29:03,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 01:29:03,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 01:29:03,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 01:29:03,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 01:29:03,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 01:29:03,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 01:29:03,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 01:29:03,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 01:29:03,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 01:29:03,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 01:29:03,571 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 01:29:03,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 01:29:03,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 01:29:03,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 7e1c4d2c7e091760d0cfd2192761696664946c8a36300f0a25d92c3977c93680 [2022-07-12 01:29:03,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 01:29:03,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 01:29:03,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 01:29:03,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 01:29:03,773 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 01:29:03,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label09.c [2022-07-12 01:29:03,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509a82866/b9a67b2f20df4114a4cd1f2d4224bc18/FLAGe15bec6f6 [2022-07-12 01:29:04,305 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 01:29:04,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label09.c [2022-07-12 01:29:04,323 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509a82866/b9a67b2f20df4114a4cd1f2d4224bc18/FLAGe15bec6f6 [2022-07-12 01:29:04,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509a82866/b9a67b2f20df4114a4cd1f2d4224bc18 [2022-07-12 01:29:04,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 01:29:04,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 01:29:04,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 01:29:04,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 01:29:04,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 01:29:04,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:29:04" (1/1) ... [2022-07-12 01:29:04,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de3fef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:04, skipping insertion in model container [2022-07-12 01:29:04,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:29:04" (1/1) ... [2022-07-12 01:29:04,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 01:29:04,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 01:29:04,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label09.c[1938,1951] [2022-07-12 01:29:05,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 01:29:05,229 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 01:29:05,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label09.c[1938,1951] [2022-07-12 01:29:05,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 01:29:05,426 INFO L208 MainTranslator]: Completed translation [2022-07-12 01:29:05,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05 WrapperNode [2022-07-12 01:29:05,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 01:29:05,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 01:29:05,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 01:29:05,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 01:29:05,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (1/1) ... [2022-07-12 01:29:05,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (1/1) ... [2022-07-12 01:29:05,679 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2611 [2022-07-12 01:29:05,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 01:29:05,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 01:29:05,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 01:29:05,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 01:29:05,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (1/1) ... [2022-07-12 01:29:05,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (1/1) ... [2022-07-12 01:29:05,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (1/1) ... [2022-07-12 01:29:05,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (1/1) ... [2022-07-12 01:29:05,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (1/1) ... [2022-07-12 01:29:05,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (1/1) ... [2022-07-12 01:29:05,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (1/1) ... [2022-07-12 01:29:05,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 01:29:05,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 01:29:05,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 01:29:05,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 01:29:05,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (1/1) ... [2022-07-12 01:29:05,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 01:29:05,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:29:06,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 01:29:06,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 01:29:06,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 01:29:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 01:29:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 01:29:06,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 01:29:06,115 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 01:29:06,116 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 01:29:08,339 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 01:29:08,347 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 01:29:08,347 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 01:29:08,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:29:08 BoogieIcfgContainer [2022-07-12 01:29:08,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 01:29:08,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 01:29:08,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 01:29:08,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 01:29:08,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:29:04" (1/3) ... [2022-07-12 01:29:08,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b1f555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:29:08, skipping insertion in model container [2022-07-12 01:29:08,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:29:05" (2/3) ... [2022-07-12 01:29:08,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b1f555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:29:08, skipping insertion in model container [2022-07-12 01:29:08,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:29:08" (3/3) ... [2022-07-12 01:29:08,355 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem17_label09.c [2022-07-12 01:29:08,364 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 01:29:08,364 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 01:29:08,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 01:29:08,407 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19884cfc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60f45fbe [2022-07-12 01:29:08,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 01:29:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 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) [2022-07-12 01:29:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 01:29:08,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:08,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:29:08,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:08,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash -569068670, now seen corresponding path program 1 times [2022-07-12 01:29:08,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:08,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763459986] [2022-07-12 01:29:08,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:08,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:29:08,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:08,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763459986] [2022-07-12 01:29:08,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763459986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:08,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:08,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:29:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243876670] [2022-07-12 01:29:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:08,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:08,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:08,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:08,555 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-07-12 01:29:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:10,702 INFO L93 Difference]: Finished difference Result 1667 states and 3061 transitions. [2022-07-12 01:29:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:10,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-07-12 01:29:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:10,723 INFO L225 Difference]: With dead ends: 1667 [2022-07-12 01:29:10,723 INFO L226 Difference]: Without dead ends: 998 [2022-07-12 01:29:10,727 INFO L412 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 [2022-07-12 01:29:10,729 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 533 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:10,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 01:29:10,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-07-12 01:29:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2022-07-12 01:29:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 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) [2022-07-12 01:29:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2022-07-12 01:29:10,873 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 12 [2022-07-12 01:29:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:10,873 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2022-07-12 01:29:10,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-07-12 01:29:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2022-07-12 01:29:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 01:29:10,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:10,875 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 01:29:10,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 01:29:10,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:10,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1540663647, now seen corresponding path program 1 times [2022-07-12 01:29:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:10,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464301748] [2022-07-12 01:29:10,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:10,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:29:10,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:10,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464301748] [2022-07-12 01:29:10,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464301748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:10,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:10,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:29:10,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48214395] [2022-07-12 01:29:10,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:10,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:10,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:10,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:10,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:10,972 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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) [2022-07-12 01:29:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:12,955 INFO L93 Difference]: Finished difference Result 2841 states and 4881 transitions. [2022-07-12 01:29:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:12,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 77 [2022-07-12 01:29:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:12,962 INFO L225 Difference]: With dead ends: 2841 [2022-07-12 01:29:12,962 INFO L226 Difference]: Without dead ends: 1861 [2022-07-12 01:29:12,964 INFO L412 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 [2022-07-12 01:29:12,965 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:12,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 496 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 01:29:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2022-07-12 01:29:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1857. [2022-07-12 01:29:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1856 states have (on average 1.4547413793103448) internal successors, (2700), 1856 states have internal predecessors, (2700), 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) [2022-07-12 01:29:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2700 transitions. [2022-07-12 01:29:12,994 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2700 transitions. Word has length 77 [2022-07-12 01:29:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:12,996 INFO L495 AbstractCegarLoop]: Abstraction has 1857 states and 2700 transitions. [2022-07-12 01:29:12,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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) [2022-07-12 01:29:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2700 transitions. [2022-07-12 01:29:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 01:29:13,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:13,004 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 01:29:13,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 01:29:13,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 463540948, now seen corresponding path program 1 times [2022-07-12 01:29:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:13,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240235677] [2022-07-12 01:29:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:29:13,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:13,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240235677] [2022-07-12 01:29:13,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240235677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:13,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:13,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:29:13,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91819342] [2022-07-12 01:29:13,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:13,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:13,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:13,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:13,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:13,207 INFO L87 Difference]: Start difference. First operand 1857 states and 2700 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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) [2022-07-12 01:29:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:15,452 INFO L93 Difference]: Finished difference Result 4591 states and 6640 transitions. [2022-07-12 01:29:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:15,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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 117 [2022-07-12 01:29:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:15,459 INFO L225 Difference]: With dead ends: 4591 [2022-07-12 01:29:15,459 INFO L226 Difference]: Without dead ends: 2736 [2022-07-12 01:29:15,461 INFO L412 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 [2022-07-12 01:29:15,462 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:15,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 537 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 01:29:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2022-07-12 01:29:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2716. [2022-07-12 01:29:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2715 states have (on average 1.390791896869245) internal successors, (3776), 2715 states have internal predecessors, (3776), 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) [2022-07-12 01:29:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3776 transitions. [2022-07-12 01:29:15,505 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3776 transitions. Word has length 117 [2022-07-12 01:29:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:15,505 INFO L495 AbstractCegarLoop]: Abstraction has 2716 states and 3776 transitions. [2022-07-12 01:29:15,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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) [2022-07-12 01:29:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3776 transitions. [2022-07-12 01:29:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-12 01:29:15,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:15,507 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 01:29:15,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 01:29:15,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1189236261, now seen corresponding path program 1 times [2022-07-12 01:29:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:15,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503816606] [2022-07-12 01:29:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:15,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:29:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:15,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503816606] [2022-07-12 01:29:15,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503816606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:15,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:15,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:29:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236712648] [2022-07-12 01:29:15,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:15,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:15,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:15,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:15,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:15,578 INFO L87 Difference]: Start difference. First operand 2716 states and 3776 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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) [2022-07-12 01:29:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:17,148 INFO L93 Difference]: Finished difference Result 6709 states and 9429 transitions. [2022-07-12 01:29:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:17,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2022-07-12 01:29:17,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:17,159 INFO L225 Difference]: With dead ends: 6709 [2022-07-12 01:29:17,159 INFO L226 Difference]: Without dead ends: 3995 [2022-07-12 01:29:17,164 INFO L412 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 [2022-07-12 01:29:17,174 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:17,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 01:29:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2022-07-12 01:29:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3142. [2022-07-12 01:29:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 3141 states have (on average 1.274434893346068) internal successors, (4003), 3141 states have internal predecessors, (4003), 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) [2022-07-12 01:29:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 4003 transitions. [2022-07-12 01:29:17,220 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 4003 transitions. Word has length 123 [2022-07-12 01:29:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:17,222 INFO L495 AbstractCegarLoop]: Abstraction has 3142 states and 4003 transitions. [2022-07-12 01:29:17,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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) [2022-07-12 01:29:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 4003 transitions. [2022-07-12 01:29:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-12 01:29:17,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:17,224 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:29:17,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 01:29:17,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:17,225 INFO L85 PathProgramCache]: Analyzing trace with hash -604395729, now seen corresponding path program 1 times [2022-07-12 01:29:17,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:17,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749156222] [2022-07-12 01:29:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:29:17,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:17,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749156222] [2022-07-12 01:29:17,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749156222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:17,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:17,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 01:29:17,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579563146] [2022-07-12 01:29:17,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:17,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 01:29:17,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:17,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 01:29:17,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:29:17,407 INFO L87 Difference]: Start difference. First operand 3142 states and 4003 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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) [2022-07-12 01:29:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:19,653 INFO L93 Difference]: Finished difference Result 8019 states and 10522 transitions. [2022-07-12 01:29:19,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:29:19,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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 160 [2022-07-12 01:29:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:19,668 INFO L225 Difference]: With dead ends: 8019 [2022-07-12 01:29:19,668 INFO L226 Difference]: Without dead ends: 4879 [2022-07-12 01:29:19,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:29:19,675 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 1096 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:19,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 881 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 01:29:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2022-07-12 01:29:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4852. [2022-07-12 01:29:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4851 states have (on average 1.2665429808286952) internal successors, (6144), 4851 states have internal predecessors, (6144), 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) [2022-07-12 01:29:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6144 transitions. [2022-07-12 01:29:19,730 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6144 transitions. Word has length 160 [2022-07-12 01:29:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:19,731 INFO L495 AbstractCegarLoop]: Abstraction has 4852 states and 6144 transitions. [2022-07-12 01:29:19,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 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) [2022-07-12 01:29:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6144 transitions. [2022-07-12 01:29:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-12 01:29:19,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:19,735 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:29:19,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 01:29:19,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -714630880, now seen corresponding path program 1 times [2022-07-12 01:29:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:19,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835193663] [2022-07-12 01:29:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:19,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-12 01:29:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:19,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835193663] [2022-07-12 01:29:19,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835193663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:19,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:19,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:29:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014870613] [2022-07-12 01:29:19,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:19,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:19,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:19,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:19,807 INFO L87 Difference]: Start difference. First operand 4852 states and 6144 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2022-07-12 01:29:21,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:21,636 INFO L93 Difference]: Finished difference Result 12249 states and 15825 transitions. [2022-07-12 01:29:21,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:21,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 166 [2022-07-12 01:29:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:21,656 INFO L225 Difference]: With dead ends: 12249 [2022-07-12 01:29:21,656 INFO L226 Difference]: Without dead ends: 7399 [2022-07-12 01:29:21,662 INFO L412 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 [2022-07-12 01:29:21,664 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 436 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:21,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 545 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 01:29:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7399 states. [2022-07-12 01:29:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7399 to 4826. [2022-07-12 01:29:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 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) [2022-07-12 01:29:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2022-07-12 01:29:21,734 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 166 [2022-07-12 01:29:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:21,734 INFO L495 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2022-07-12 01:29:21,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2022-07-12 01:29:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2022-07-12 01:29:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-12 01:29:21,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:21,736 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:29:21,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 01:29:21,736 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1628723596, now seen corresponding path program 1 times [2022-07-12 01:29:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:21,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400899985] [2022-07-12 01:29:21,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 01:29:21,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:21,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400899985] [2022-07-12 01:29:21,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400899985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:21,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:21,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:29:21,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449436196] [2022-07-12 01:29:21,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:21,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:21,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:21,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:21,805 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2022-07-12 01:29:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:23,625 INFO L93 Difference]: Finished difference Result 12204 states and 15757 transitions. [2022-07-12 01:29:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:23,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 179 [2022-07-12 01:29:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:23,643 INFO L225 Difference]: With dead ends: 12204 [2022-07-12 01:29:23,643 INFO L226 Difference]: Without dead ends: 7380 [2022-07-12 01:29:23,647 INFO L412 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 [2022-07-12 01:29:23,648 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 460 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:23,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 511 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 01:29:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7380 states. [2022-07-12 01:29:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7380 to 6525. [2022-07-12 01:29:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6525 states, 6524 states have (on average 1.2665542611894542) internal successors, (8263), 6524 states have internal predecessors, (8263), 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) [2022-07-12 01:29:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6525 states to 6525 states and 8263 transitions. [2022-07-12 01:29:23,744 INFO L78 Accepts]: Start accepts. Automaton has 6525 states and 8263 transitions. Word has length 179 [2022-07-12 01:29:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:23,744 INFO L495 AbstractCegarLoop]: Abstraction has 6525 states and 8263 transitions. [2022-07-12 01:29:23,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2022-07-12 01:29:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6525 states and 8263 transitions. [2022-07-12 01:29:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-12 01:29:23,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:23,746 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:29:23,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 01:29:23,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:23,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:23,747 INFO L85 PathProgramCache]: Analyzing trace with hash 456712304, now seen corresponding path program 1 times [2022-07-12 01:29:23,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:23,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710213] [2022-07-12 01:29:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 01:29:23,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:23,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710213] [2022-07-12 01:29:23,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:23,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:23,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:29:23,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250774429] [2022-07-12 01:29:23,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:23,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:23,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:23,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:23,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:23,840 INFO L87 Difference]: Start difference. First operand 6525 states and 8263 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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) [2022-07-12 01:29:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:25,853 INFO L93 Difference]: Finished difference Result 17751 states and 22351 transitions. [2022-07-12 01:29:25,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:25,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 228 [2022-07-12 01:29:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:25,866 INFO L225 Difference]: With dead ends: 17751 [2022-07-12 01:29:25,866 INFO L226 Difference]: Without dead ends: 9951 [2022-07-12 01:29:25,870 INFO L412 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 [2022-07-12 01:29:25,870 INFO L413 NwaCegarLoop]: 946 mSDtfsCounter, 488 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:25,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1019 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 01:29:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9951 states. [2022-07-12 01:29:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9951 to 9943. [2022-07-12 01:29:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9943 states, 9942 states have (on average 1.208006437336552) internal successors, (12010), 9942 states have internal predecessors, (12010), 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) [2022-07-12 01:29:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9943 states to 9943 states and 12010 transitions. [2022-07-12 01:29:25,965 INFO L78 Accepts]: Start accepts. Automaton has 9943 states and 12010 transitions. Word has length 228 [2022-07-12 01:29:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:25,965 INFO L495 AbstractCegarLoop]: Abstraction has 9943 states and 12010 transitions. [2022-07-12 01:29:25,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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) [2022-07-12 01:29:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9943 states and 12010 transitions. [2022-07-12 01:29:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-07-12 01:29:25,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:25,968 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:29:25,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 01:29:25,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:25,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1907858662, now seen corresponding path program 1 times [2022-07-12 01:29:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:25,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117291989] [2022-07-12 01:29:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:25,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 01:29:26,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:26,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117291989] [2022-07-12 01:29:26,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117291989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:26,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:26,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:29:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280172089] [2022-07-12 01:29:26,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:26,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:26,066 INFO L87 Difference]: Start difference. First operand 9943 states and 12010 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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) [2022-07-12 01:29:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:27,845 INFO L93 Difference]: Finished difference Result 20736 states and 24968 transitions. [2022-07-12 01:29:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:27,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 232 [2022-07-12 01:29:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:27,895 INFO L225 Difference]: With dead ends: 20736 [2022-07-12 01:29:27,895 INFO L226 Difference]: Without dead ends: 10795 [2022-07-12 01:29:27,918 INFO L412 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 [2022-07-12 01:29:27,919 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 418 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:27,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 985 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 01:29:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10795 states. [2022-07-12 01:29:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10795 to 10369. [2022-07-12 01:29:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10369 states, 10368 states have (on average 1.2040895061728396) internal successors, (12484), 10368 states have internal predecessors, (12484), 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) [2022-07-12 01:29:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10369 states to 10369 states and 12484 transitions. [2022-07-12 01:29:28,209 INFO L78 Accepts]: Start accepts. Automaton has 10369 states and 12484 transitions. Word has length 232 [2022-07-12 01:29:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:28,224 INFO L495 AbstractCegarLoop]: Abstraction has 10369 states and 12484 transitions. [2022-07-12 01:29:28,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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) [2022-07-12 01:29:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 10369 states and 12484 transitions. [2022-07-12 01:29:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-07-12 01:29:28,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:28,227 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:29:28,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 01:29:28,227 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:28,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:28,228 INFO L85 PathProgramCache]: Analyzing trace with hash 724784780, now seen corresponding path program 1 times [2022-07-12 01:29:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:28,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097330704] [2022-07-12 01:29:28,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:28,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 158 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 01:29:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:28,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097330704] [2022-07-12 01:29:28,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097330704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:29:28,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750512382] [2022-07-12 01:29:28,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:28,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:29:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:29:28,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 01:29:28,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 01:29:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:28,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 01:29:28,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:29:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 158 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 01:29:29,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:29:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 01:29:29,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750512382] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 01:29:29,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 01:29:29,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2022-07-12 01:29:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686729723] [2022-07-12 01:29:29,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:29,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 01:29:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:29,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 01:29:29,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:29:29,259 INFO L87 Difference]: Start difference. First operand 10369 states and 12484 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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) [2022-07-12 01:29:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:32,711 INFO L93 Difference]: Finished difference Result 30985 states and 37761 transitions. [2022-07-12 01:29:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:29:32,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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 236 [2022-07-12 01:29:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:32,736 INFO L225 Difference]: With dead ends: 30985 [2022-07-12 01:29:32,737 INFO L226 Difference]: Without dead ends: 19753 [2022-07-12 01:29:32,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 467 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:29:32,746 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 1117 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 1345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 3621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1345 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:32,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 143 Invalid, 3621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1345 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 01:29:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19753 states. [2022-07-12 01:29:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19753 to 19752. [2022-07-12 01:29:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19752 states, 19751 states have (on average 1.158321097665941) internal successors, (22878), 19751 states have internal predecessors, (22878), 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) [2022-07-12 01:29:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19752 states to 19752 states and 22878 transitions. [2022-07-12 01:29:32,923 INFO L78 Accepts]: Start accepts. Automaton has 19752 states and 22878 transitions. Word has length 236 [2022-07-12 01:29:32,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:32,924 INFO L495 AbstractCegarLoop]: Abstraction has 19752 states and 22878 transitions. [2022-07-12 01:29:32,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 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) [2022-07-12 01:29:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 19752 states and 22878 transitions. [2022-07-12 01:29:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-12 01:29:32,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:32,927 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:29:32,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 01:29:33,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 01:29:33,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1956249984, now seen corresponding path program 1 times [2022-07-12 01:29:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:33,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476990496] [2022-07-12 01:29:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-12 01:29:33,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:33,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476990496] [2022-07-12 01:29:33,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476990496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:33,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:33,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:29:33,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300339116] [2022-07-12 01:29:33,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:33,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:33,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:33,216 INFO L87 Difference]: Start difference. First operand 19752 states and 22878 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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) [2022-07-12 01:29:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:34,480 INFO L93 Difference]: Finished difference Result 42479 states and 49308 transitions. [2022-07-12 01:29:34,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:34,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 249 [2022-07-12 01:29:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:34,551 INFO L225 Difference]: With dead ends: 42479 [2022-07-12 01:29:34,552 INFO L226 Difference]: Without dead ends: 22729 [2022-07-12 01:29:34,568 INFO L412 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 [2022-07-12 01:29:34,569 INFO L413 NwaCegarLoop]: 790 mSDtfsCounter, 378 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:34,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 856 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 01:29:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22729 states. [2022-07-12 01:29:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22729 to 22303. [2022-07-12 01:29:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22303 states, 22302 states have (on average 1.1478342749529191) internal successors, (25599), 22302 states have internal predecessors, (25599), 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) [2022-07-12 01:29:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22303 states to 22303 states and 25599 transitions. [2022-07-12 01:29:34,875 INFO L78 Accepts]: Start accepts. Automaton has 22303 states and 25599 transitions. Word has length 249 [2022-07-12 01:29:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:34,875 INFO L495 AbstractCegarLoop]: Abstraction has 22303 states and 25599 transitions. [2022-07-12 01:29:34,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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) [2022-07-12 01:29:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 22303 states and 25599 transitions. [2022-07-12 01:29:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-07-12 01:29:34,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:34,878 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-12 01:29:34,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 01:29:34,878 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:34,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash 360694187, now seen corresponding path program 1 times [2022-07-12 01:29:34,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:34,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521391002] [2022-07-12 01:29:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 01:29:34,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:34,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521391002] [2022-07-12 01:29:34,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521391002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:34,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:34,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 01:29:34,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662629910] [2022-07-12 01:29:34,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:34,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 01:29:34,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:34,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 01:29:34,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 01:29:34,965 INFO L87 Difference]: Start difference. First operand 22303 states and 25599 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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) [2022-07-12 01:29:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:38,097 INFO L93 Difference]: Finished difference Result 56130 states and 65063 transitions. [2022-07-12 01:29:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:29:38,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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 272 [2022-07-12 01:29:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:38,133 INFO L225 Difference]: With dead ends: 56130 [2022-07-12 01:29:38,133 INFO L226 Difference]: Without dead ends: 30848 [2022-07-12 01:29:38,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 01:29:38,146 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 891 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2833 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 3276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:38,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 374 Invalid, 3276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2833 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 01:29:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30848 states. [2022-07-12 01:29:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30848 to 29526. [2022-07-12 01:29:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29526 states, 29525 states have (on average 1.159424216765453) internal successors, (34232), 29525 states have internal predecessors, (34232), 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) [2022-07-12 01:29:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29526 states to 29526 states and 34232 transitions. [2022-07-12 01:29:38,395 INFO L78 Accepts]: Start accepts. Automaton has 29526 states and 34232 transitions. Word has length 272 [2022-07-12 01:29:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:38,396 INFO L495 AbstractCegarLoop]: Abstraction has 29526 states and 34232 transitions. [2022-07-12 01:29:38,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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) [2022-07-12 01:29:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 29526 states and 34232 transitions. [2022-07-12 01:29:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-07-12 01:29:38,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:38,400 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-12 01:29:38,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 01:29:38,401 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:38,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash 716024662, now seen corresponding path program 1 times [2022-07-12 01:29:38,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:38,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402180104] [2022-07-12 01:29:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:38,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 01:29:38,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:38,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402180104] [2022-07-12 01:29:38,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402180104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:38,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:38,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:29:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221373981] [2022-07-12 01:29:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:38,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:38,491 INFO L87 Difference]: Start difference. First operand 29526 states and 34232 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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) [2022-07-12 01:29:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:40,480 INFO L93 Difference]: Finished difference Result 74398 states and 86009 transitions. [2022-07-12 01:29:40,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:40,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 287 [2022-07-12 01:29:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:40,537 INFO L225 Difference]: With dead ends: 74398 [2022-07-12 01:29:40,538 INFO L226 Difference]: Without dead ends: 41896 [2022-07-12 01:29:40,563 INFO L412 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 [2022-07-12 01:29:40,565 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 363 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:40,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 808 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 01:29:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41896 states. [2022-07-12 01:29:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41896 to 41037. [2022-07-12 01:29:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41037 states, 41036 states have (on average 1.1224047178087533) internal successors, (46059), 41036 states have internal predecessors, (46059), 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) [2022-07-12 01:29:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41037 states to 41037 states and 46059 transitions. [2022-07-12 01:29:41,192 INFO L78 Accepts]: Start accepts. Automaton has 41037 states and 46059 transitions. Word has length 287 [2022-07-12 01:29:41,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:41,192 INFO L495 AbstractCegarLoop]: Abstraction has 41037 states and 46059 transitions. [2022-07-12 01:29:41,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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) [2022-07-12 01:29:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 41037 states and 46059 transitions. [2022-07-12 01:29:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2022-07-12 01:29:41,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:41,195 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:29:41,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 01:29:41,195 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:41,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash 541840298, now seen corresponding path program 1 times [2022-07-12 01:29:41,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:41,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203613654] [2022-07-12 01:29:41,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:41,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 238 proven. 214 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 01:29:41,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:41,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203613654] [2022-07-12 01:29:41,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203613654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:29:41,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353112307] [2022-07-12 01:29:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:29:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:29:41,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 01:29:41,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 01:29:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:41,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 01:29:41,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:29:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 299 proven. 73 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 01:29:41,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:29:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 01:29:42,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353112307] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 01:29:42,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 01:29:42,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2022-07-12 01:29:42,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688381641] [2022-07-12 01:29:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:42,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 01:29:42,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:42,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 01:29:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 01:29:42,042 INFO L87 Difference]: Start difference. First operand 41037 states and 46059 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 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) [2022-07-12 01:29:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:44,909 INFO L93 Difference]: Finished difference Result 97844 states and 109929 transitions. [2022-07-12 01:29:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:29:44,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 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 310 [2022-07-12 01:29:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:44,975 INFO L225 Difference]: With dead ends: 97844 [2022-07-12 01:29:44,975 INFO L226 Difference]: Without dead ends: 56809 [2022-07-12 01:29:45,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 615 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 01:29:45,006 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 851 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:45,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 201 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-12 01:29:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56809 states. [2022-07-12 01:29:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56809 to 53829. [2022-07-12 01:29:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53829 states, 53828 states have (on average 1.126216838819945) internal successors, (60622), 53828 states have internal predecessors, (60622), 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) [2022-07-12 01:29:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53829 states to 53829 states and 60622 transitions. [2022-07-12 01:29:45,719 INFO L78 Accepts]: Start accepts. Automaton has 53829 states and 60622 transitions. Word has length 310 [2022-07-12 01:29:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:45,720 INFO L495 AbstractCegarLoop]: Abstraction has 53829 states and 60622 transitions. [2022-07-12 01:29:45,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 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) [2022-07-12 01:29:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 53829 states and 60622 transitions. [2022-07-12 01:29:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2022-07-12 01:29:45,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:45,723 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-12 01:29:45,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 01:29:45,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 01:29:45,938 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2012085875, now seen corresponding path program 1 times [2022-07-12 01:29:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:45,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826202839] [2022-07-12 01:29:45,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:45,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-12 01:29:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:46,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826202839] [2022-07-12 01:29:46,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826202839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:46,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:46,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:29:46,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135162621] [2022-07-12 01:29:46,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:46,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:46,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:46,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:46,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:46,066 INFO L87 Difference]: Start difference. First operand 53829 states and 60622 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2022-07-12 01:29:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:48,051 INFO L93 Difference]: Finished difference Result 115335 states and 130060 transitions. [2022-07-12 01:29:48,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:48,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 324 [2022-07-12 01:29:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:48,128 INFO L225 Difference]: With dead ends: 115335 [2022-07-12 01:29:48,129 INFO L226 Difference]: Without dead ends: 61078 [2022-07-12 01:29:48,165 INFO L412 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 [2022-07-12 01:29:48,166 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 504 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:48,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 310 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 01:29:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61078 states. [2022-07-12 01:29:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61078 to 59370. [2022-07-12 01:29:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59370 states, 59369 states have (on average 1.1245262679176) internal successors, (66762), 59369 states have internal predecessors, (66762), 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) [2022-07-12 01:29:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59370 states to 59370 states and 66762 transitions. [2022-07-12 01:29:48,973 INFO L78 Accepts]: Start accepts. Automaton has 59370 states and 66762 transitions. Word has length 324 [2022-07-12 01:29:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:48,974 INFO L495 AbstractCegarLoop]: Abstraction has 59370 states and 66762 transitions. [2022-07-12 01:29:48,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2022-07-12 01:29:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 59370 states and 66762 transitions. [2022-07-12 01:29:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-07-12 01:29:48,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:48,977 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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] [2022-07-12 01:29:48,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 01:29:48,977 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:48,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1022421116, now seen corresponding path program 1 times [2022-07-12 01:29:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:48,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572429473] [2022-07-12 01:29:48,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-12 01:29:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:49,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572429473] [2022-07-12 01:29:49,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572429473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:49,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:49,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:29:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245022563] [2022-07-12 01:29:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:49,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:49,065 INFO L87 Difference]: Start difference. First operand 59370 states and 66762 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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) [2022-07-12 01:29:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:51,038 INFO L93 Difference]: Finished difference Result 134905 states and 151659 transitions. [2022-07-12 01:29:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:51,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 340 [2022-07-12 01:29:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:51,159 INFO L225 Difference]: With dead ends: 134905 [2022-07-12 01:29:51,160 INFO L226 Difference]: Without dead ends: 72558 [2022-07-12 01:29:51,207 INFO L412 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 [2022-07-12 01:29:51,215 INFO L413 NwaCegarLoop]: 777 mSDtfsCounter, 383 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:51,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 834 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 01:29:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72558 states. [2022-07-12 01:29:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72558 to 61033. [2022-07-12 01:29:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61033 states, 61032 states have (on average 1.1192489186000787) internal successors, (68310), 61032 states have internal predecessors, (68310), 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) [2022-07-12 01:29:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61033 states to 61033 states and 68310 transitions. [2022-07-12 01:29:52,239 INFO L78 Accepts]: Start accepts. Automaton has 61033 states and 68310 transitions. Word has length 340 [2022-07-12 01:29:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:52,240 INFO L495 AbstractCegarLoop]: Abstraction has 61033 states and 68310 transitions. [2022-07-12 01:29:52,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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) [2022-07-12 01:29:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 61033 states and 68310 transitions. [2022-07-12 01:29:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2022-07-12 01:29:52,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:52,244 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-12 01:29:52,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 01:29:52,244 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:52,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 4203890, now seen corresponding path program 1 times [2022-07-12 01:29:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:52,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751077099] [2022-07-12 01:29:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-12 01:29:52,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:52,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751077099] [2022-07-12 01:29:52,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751077099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:52,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:52,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:29:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629028254] [2022-07-12 01:29:52,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:52,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:52,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:52,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:52,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:52,404 INFO L87 Difference]: Start difference. First operand 61033 states and 68310 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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) [2022-07-12 01:29:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:54,314 INFO L93 Difference]: Finished difference Result 137375 states and 153487 transitions. [2022-07-12 01:29:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:54,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 345 [2022-07-12 01:29:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:54,397 INFO L225 Difference]: With dead ends: 137375 [2022-07-12 01:29:54,397 INFO L226 Difference]: Without dead ends: 71232 [2022-07-12 01:29:54,412 INFO L412 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 [2022-07-12 01:29:54,412 INFO L413 NwaCegarLoop]: 679 mSDtfsCounter, 482 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:54,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 724 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 01:29:54,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71232 states. [2022-07-12 01:29:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71232 to 71223. [2022-07-12 01:29:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71223 states, 71222 states have (on average 1.0991968773693521) internal successors, (78287), 71222 states have internal predecessors, (78287), 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) [2022-07-12 01:29:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71223 states to 71223 states and 78287 transitions. [2022-07-12 01:29:55,432 INFO L78 Accepts]: Start accepts. Automaton has 71223 states and 78287 transitions. Word has length 345 [2022-07-12 01:29:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:55,432 INFO L495 AbstractCegarLoop]: Abstraction has 71223 states and 78287 transitions. [2022-07-12 01:29:55,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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) [2022-07-12 01:29:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 71223 states and 78287 transitions. [2022-07-12 01:29:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2022-07-12 01:29:55,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:55,452 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:29:55,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 01:29:55,453 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:55,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1918113595, now seen corresponding path program 1 times [2022-07-12 01:29:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:55,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112164654] [2022-07-12 01:29:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 01:29:55,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112164654] [2022-07-12 01:29:55,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112164654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:29:55,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:29:55,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:29:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669169424] [2022-07-12 01:29:55,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:29:55,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:29:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:29:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:29:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:29:55,582 INFO L87 Difference]: Start difference. First operand 71223 states and 78287 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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) [2022-07-12 01:29:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:29:57,461 INFO L93 Difference]: Finished difference Result 157773 states and 173760 transitions. [2022-07-12 01:29:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:29:57,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 [2022-07-12 01:29:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:29:57,566 INFO L225 Difference]: With dead ends: 157773 [2022-07-12 01:29:57,566 INFO L226 Difference]: Without dead ends: 86552 [2022-07-12 01:29:57,603 INFO L412 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 [2022-07-12 01:29:57,604 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 412 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 01:29:57,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 299 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 01:29:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86552 states. [2022-07-12 01:29:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86552 to 79305. [2022-07-12 01:29:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79305 states, 79304 states have (on average 1.0928956925249673) internal successors, (86671), 79304 states have internal predecessors, (86671), 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) [2022-07-12 01:29:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79305 states to 79305 states and 86671 transitions. [2022-07-12 01:29:58,631 INFO L78 Accepts]: Start accepts. Automaton has 79305 states and 86671 transitions. Word has length 358 [2022-07-12 01:29:58,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:29:58,631 INFO L495 AbstractCegarLoop]: Abstraction has 79305 states and 86671 transitions. [2022-07-12 01:29:58,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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) [2022-07-12 01:29:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 79305 states and 86671 transitions. [2022-07-12 01:29:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2022-07-12 01:29:58,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:29:58,638 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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] [2022-07-12 01:29:58,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 01:29:58,638 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:29:58,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:29:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1419132856, now seen corresponding path program 1 times [2022-07-12 01:29:58,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:29:58,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39527253] [2022-07-12 01:29:58,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:58,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:29:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 244 proven. 10 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-07-12 01:29:58,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:29:58,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39527253] [2022-07-12 01:29:58,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39527253] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:29:58,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478177614] [2022-07-12 01:29:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:29:58,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:29:58,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:29:58,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 01:29:58,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 01:29:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:29:59,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 01:29:59,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:29:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 349 proven. 82 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 01:29:59,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:30:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 349 proven. 82 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 01:30:00,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478177614] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:30:00,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:30:00,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-07-12 01:30:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912138419] [2022-07-12 01:30:00,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:30:00,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 01:30:00,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:30:00,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 01:30:00,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 01:30:00,161 INFO L87 Difference]: Start difference. First operand 79305 states and 86671 transitions. Second operand has 9 states, 9 states have (on average 78.55555555555556) internal successors, (707), 9 states have internal predecessors, (707), 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) [2022-07-12 01:30:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:30:09,798 INFO L93 Difference]: Finished difference Result 207161 states and 225176 transitions. [2022-07-12 01:30:09,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 01:30:09,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 78.55555555555556) internal successors, (707), 9 states have internal predecessors, (707), 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 392 [2022-07-12 01:30:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:30:09,949 INFO L225 Difference]: With dead ends: 207161 [2022-07-12 01:30:09,950 INFO L226 Difference]: Without dead ends: 123606 [2022-07-12 01:30:09,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2022-07-12 01:30:09,969 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 7799 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 9944 mSolverCounterSat, 2094 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7799 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 12038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2094 IncrementalHoareTripleChecker+Valid, 9944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-12 01:30:09,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7799 Valid, 350 Invalid, 12038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2094 Valid, 9944 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-07-12 01:30:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123606 states. [2022-07-12 01:30:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123606 to 106926. [2022-07-12 01:30:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106926 states, 106925 states have (on average 1.0724526537292496) internal successors, (114672), 106925 states have internal predecessors, (114672), 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) [2022-07-12 01:30:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106926 states to 106926 states and 114672 transitions. [2022-07-12 01:30:11,473 INFO L78 Accepts]: Start accepts. Automaton has 106926 states and 114672 transitions. Word has length 392 [2022-07-12 01:30:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:30:11,474 INFO L495 AbstractCegarLoop]: Abstraction has 106926 states and 114672 transitions. [2022-07-12 01:30:11,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 78.55555555555556) internal successors, (707), 9 states have internal predecessors, (707), 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) [2022-07-12 01:30:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 106926 states and 114672 transitions. [2022-07-12 01:30:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2022-07-12 01:30:11,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:30:11,480 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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] [2022-07-12 01:30:11,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 01:30:11,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:30:11,702 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:30:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:30:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1187910031, now seen corresponding path program 1 times [2022-07-12 01:30:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:30:11,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018423774] [2022-07-12 01:30:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:30:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:30:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:30:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2022-07-12 01:30:11,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:30:11,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018423774] [2022-07-12 01:30:11,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018423774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:30:11,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:30:11,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:30:11,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698107141] [2022-07-12 01:30:11,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:30:11,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:30:11,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:30:11,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:30:11,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:30:11,820 INFO L87 Difference]: Start difference. First operand 106926 states and 114672 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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) [2022-07-12 01:30:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:30:13,859 INFO L93 Difference]: Finished difference Result 215982 states and 231526 transitions. [2022-07-12 01:30:13,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:30:13,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 478 [2022-07-12 01:30:13,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:30:13,981 INFO L225 Difference]: With dead ends: 215982 [2022-07-12 01:30:13,981 INFO L226 Difference]: Without dead ends: 109058 [2022-07-12 01:30:14,036 INFO L412 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 [2022-07-12 01:30:14,038 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 432 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 01:30:14,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 366 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 01:30:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109058 states. [2022-07-12 01:30:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109058 to 108203. [2022-07-12 01:30:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108203 states, 108202 states have (on average 1.0677529066006173) internal successors, (115533), 108202 states have internal predecessors, (115533), 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) [2022-07-12 01:30:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108203 states to 108203 states and 115533 transitions. [2022-07-12 01:30:15,669 INFO L78 Accepts]: Start accepts. Automaton has 108203 states and 115533 transitions. Word has length 478 [2022-07-12 01:30:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:30:15,669 INFO L495 AbstractCegarLoop]: Abstraction has 108203 states and 115533 transitions. [2022-07-12 01:30:15,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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) [2022-07-12 01:30:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 108203 states and 115533 transitions. [2022-07-12 01:30:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2022-07-12 01:30:15,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:30:15,677 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 01:30:15,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 01:30:15,677 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:30:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:30:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash -465471891, now seen corresponding path program 1 times [2022-07-12 01:30:15,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:30:15,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087378963] [2022-07-12 01:30:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:30:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:30:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:30:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 373 proven. 82 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 01:30:15,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:30:15,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087378963] [2022-07-12 01:30:15,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087378963] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:30:15,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063994027] [2022-07-12 01:30:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:30:15,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:30:15,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:30:15,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 01:30:15,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 01:30:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:30:16,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 01:30:16,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:30:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 373 proven. 82 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 01:30:17,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:30:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 454 proven. 1 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 01:30:17,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063994027] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:30:17,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:30:17,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-07-12 01:30:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236077783] [2022-07-12 01:30:17,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:30:17,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 01:30:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:30:17,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 01:30:17,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 01:30:17,833 INFO L87 Difference]: Start difference. First operand 108203 states and 115533 transitions. Second operand has 10 states, 10 states have (on average 75.0) internal successors, (750), 9 states have internal predecessors, (750), 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) [2022-07-12 01:30:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:30:23,132 INFO L93 Difference]: Finished difference Result 228976 states and 244440 transitions. [2022-07-12 01:30:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 01:30:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 75.0) internal successors, (750), 9 states have internal predecessors, (750), 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 500 [2022-07-12 01:30:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:30:23,273 INFO L225 Difference]: With dead ends: 228976 [2022-07-12 01:30:23,274 INFO L226 Difference]: Without dead ends: 121200 [2022-07-12 01:30:23,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 994 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-07-12 01:30:23,313 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 3239 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 6215 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3239 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 7028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 6215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 01:30:23,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3239 Valid, 384 Invalid, 7028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 6215 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 01:30:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121200 states. [2022-07-12 01:30:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121200 to 105222. [2022-07-12 01:30:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105222 states, 105221 states have (on average 1.0678381691867593) internal successors, (112359), 105221 states have internal predecessors, (112359), 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) [2022-07-12 01:30:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105222 states to 105222 states and 112359 transitions. [2022-07-12 01:30:24,699 INFO L78 Accepts]: Start accepts. Automaton has 105222 states and 112359 transitions. Word has length 500 [2022-07-12 01:30:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:30:24,699 INFO L495 AbstractCegarLoop]: Abstraction has 105222 states and 112359 transitions. [2022-07-12 01:30:24,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.0) internal successors, (750), 9 states have internal predecessors, (750), 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) [2022-07-12 01:30:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 105222 states and 112359 transitions. [2022-07-12 01:30:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2022-07-12 01:30:24,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:30:24,708 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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] [2022-07-12 01:30:24,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 01:30:24,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:30:24,926 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:30:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:30:24,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1861228897, now seen corresponding path program 1 times [2022-07-12 01:30:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:30:24,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642572560] [2022-07-12 01:30:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:30:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:30:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:30:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 346 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-12 01:30:25,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:30:25,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642572560] [2022-07-12 01:30:25,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642572560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:30:25,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737417989] [2022-07-12 01:30:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:30:25,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:30:25,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:30:25,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 01:30:25,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 01:30:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:30:25,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 01:30:25,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:30:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 244 proven. 10 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-12 01:30:25,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:30:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-12 01:30:25,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737417989] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 01:30:25,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 01:30:25,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2022-07-12 01:30:25,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676132897] [2022-07-12 01:30:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:30:25,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 01:30:25,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:30:25,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 01:30:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-12 01:30:25,886 INFO L87 Difference]: Start difference. First operand 105222 states and 112359 transitions. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 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) [2022-07-12 01:30:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:30:28,835 INFO L93 Difference]: Finished difference Result 223651 states and 238739 transitions. [2022-07-12 01:30:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:30:28,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 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 579 [2022-07-12 01:30:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:30:28,969 INFO L225 Difference]: With dead ends: 223651 [2022-07-12 01:30:28,970 INFO L226 Difference]: Without dead ends: 118006 [2022-07-12 01:30:29,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1154 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-12 01:30:29,031 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 989 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 01:30:29,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 155 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 01:30:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118006 states. [2022-07-12 01:30:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118006 to 112889. [2022-07-12 01:30:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112889 states, 112888 states have (on average 1.069041882219545) internal successors, (120682), 112888 states have internal predecessors, (120682), 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) [2022-07-12 01:30:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112889 states to 112889 states and 120682 transitions. [2022-07-12 01:30:30,578 INFO L78 Accepts]: Start accepts. Automaton has 112889 states and 120682 transitions. Word has length 579 [2022-07-12 01:30:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:30:30,578 INFO L495 AbstractCegarLoop]: Abstraction has 112889 states and 120682 transitions. [2022-07-12 01:30:30,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 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) [2022-07-12 01:30:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 112889 states and 120682 transitions. [2022-07-12 01:30:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2022-07-12 01:30:30,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:30:30,594 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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] [2022-07-12 01:30:30,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 01:30:30,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 01:30:30,811 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:30:30,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:30:30,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1077603837, now seen corresponding path program 1 times [2022-07-12 01:30:30,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:30:30,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788091997] [2022-07-12 01:30:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:30:30,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:30:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:30:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-12 01:30:31,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:30:31,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788091997] [2022-07-12 01:30:31,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788091997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:30:31,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:30:31,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:30:31,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634939388] [2022-07-12 01:30:31,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:30:31,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:30:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:30:31,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:30:31,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:30:31,012 INFO L87 Difference]: Start difference. First operand 112889 states and 120682 transitions. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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) [2022-07-12 01:30:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:30:33,563 INFO L93 Difference]: Finished difference Result 233450 states and 249679 transitions. [2022-07-12 01:30:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:30:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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 667 [2022-07-12 01:30:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:30:33,717 INFO L225 Difference]: With dead ends: 233450 [2022-07-12 01:30:33,717 INFO L226 Difference]: Without dead ends: 120563 [2022-07-12 01:30:33,765 INFO L412 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 [2022-07-12 01:30:33,765 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 414 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:30:33,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 241 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 01:30:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120563 states. [2022-07-12 01:30:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120563 to 118847. [2022-07-12 01:30:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118847 states, 118846 states have (on average 1.068475169547145) internal successors, (126984), 118846 states have internal predecessors, (126984), 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) [2022-07-12 01:30:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118847 states to 118847 states and 126984 transitions. [2022-07-12 01:30:35,537 INFO L78 Accepts]: Start accepts. Automaton has 118847 states and 126984 transitions. Word has length 667 [2022-07-12 01:30:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:30:35,537 INFO L495 AbstractCegarLoop]: Abstraction has 118847 states and 126984 transitions. [2022-07-12 01:30:35,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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) [2022-07-12 01:30:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 118847 states and 126984 transitions. [2022-07-12 01:30:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2022-07-12 01:30:35,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:30:35,553 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 01:30:35,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 01:30:35,554 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:30:35,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:30:35,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1400572411, now seen corresponding path program 1 times [2022-07-12 01:30:35,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:30:35,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322621956] [2022-07-12 01:30:35,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:30:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:30:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 01:30:35,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 01:30:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 01:30:35,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 01:30:35,894 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 01:30:35,894 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 01:30:35,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 01:30:35,899 INFO L356 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] [2022-07-12 01:30:35,903 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 01:30:36,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 01:30:36 BoogieIcfgContainer [2022-07-12 01:30:36,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 01:30:36,083 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 01:30:36,083 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 01:30:36,083 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 01:30:36,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:29:08" (3/4) ... [2022-07-12 01:30:36,085 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 01:30:36,268 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 01:30:36,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 01:30:36,269 INFO L158 Benchmark]: Toolchain (without parser) took 91643.82ms. Allocated memory was 96.5MB in the beginning and 10.7GB in the end (delta: 10.6GB). Free memory was 56.7MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2022-07-12 01:30:36,269 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 52.7MB in the beginning and 52.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 01:30:36,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 800.48ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 56.4MB in the beginning and 50.3MB in the end (delta: 6.1MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-07-12 01:30:36,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 252.78ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 50.3MB in the beginning and 63.9MB in the end (delta: -13.5MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2022-07-12 01:30:36,270 INFO L158 Benchmark]: Boogie Preprocessor took 279.03ms. Allocated memory is still 146.8MB. Free memory was 63.9MB in the beginning and 49.6MB in the end (delta: 14.3MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2022-07-12 01:30:36,270 INFO L158 Benchmark]: RCFGBuilder took 2388.84ms. Allocated memory was 146.8MB in the beginning and 385.9MB in the end (delta: 239.1MB). Free memory was 49.2MB in the beginning and 270.6MB in the end (delta: -221.4MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. [2022-07-12 01:30:36,272 INFO L158 Benchmark]: TraceAbstraction took 87732.15ms. Allocated memory was 385.9MB in the beginning and 10.7GB in the end (delta: 10.3GB). Free memory was 269.5MB in the beginning and 7.4GB in the end (delta: -7.2GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2022-07-12 01:30:36,272 INFO L158 Benchmark]: Witness Printer took 185.47ms. Allocated memory is still 10.7GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 49.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2022-07-12 01:30:36,276 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 52.7MB in the beginning and 52.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 800.48ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 56.4MB in the beginning and 50.3MB in the end (delta: 6.1MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 252.78ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 50.3MB in the beginning and 63.9MB in the end (delta: -13.5MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 279.03ms. Allocated memory is still 146.8MB. Free memory was 63.9MB in the beginning and 49.6MB in the end (delta: 14.3MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2388.84ms. Allocated memory was 146.8MB in the beginning and 385.9MB in the end (delta: 239.1MB). Free memory was 49.2MB in the beginning and 270.6MB in the end (delta: -221.4MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. * TraceAbstraction took 87732.15ms. Allocated memory was 385.9MB in the beginning and 10.7GB in the end (delta: 10.3GB). Free memory was 269.5MB in the beginning and 7.4GB in the end (delta: -7.2GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 185.47ms. Allocated memory is still 10.7GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 49.8MB). Peak memory consumption was 50.3MB. 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: 54]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int inputA = 1; [L19] int inputB = 2; [L20] int inputC = 3; [L21] int inputE = 5; [L22] int inputD = 4; [L23] int inputF = 6; [L26] int a24 = 1; [L27] int a21 = 124; [L28] int a26 = 222; [L29] int a14 = -79; [L30] int a28 = 111; VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2587] int output = -1; VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [\old(input)=6, a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND TRUE ( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 )) [L334] a14 = ((((a14 % 299909)- 300090) + 0) + -1) [L335] a26 = ((((a26 * 9)/ 10) - 554854) * 1) [L336] a28 = ((((a28 * 9)/ 10) * 1) - 589002) [L337] a24 = 2 [L339] return 25; VAL [\old(input)=6, \result=25, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(( a21 <= 127 && ((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && (input == 3)) && a21 <= 127 ) && (a24==3)))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((a24==2) && ( 217 < a26 && (((input == 4) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 )))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(( a21 <= 127 && ((( ((-114 < a14) && (-84 >= a14)) && ( ((124 < a26) && (217 >= a26)) && (input == 2))) && (a24==3)) && a28 <= 37 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==3)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a24==3) && ( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a14 <= -182 ) && 217 < a26 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND FALSE !(( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 6) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a21 <= 127 ) && (a24==2))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L568] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ((((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && a26 <= -68 ) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !((((a24==2) && (((input == 2) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 )) || ( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ))) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L580] COND FALSE !((((( -84 < a14 && ((input == 2) && a21 <= 127 )) && a26 <= -68 ) && (a24==2)) && ((37 < a28) && (134 >= a28)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)) && ((-182 < a14) && (-114 >= a14)) ))) && a26 <= -68 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (((input == 3) && ((-68 < a26) && (124 >= a26)) ) && 300 < a28 ))) && (a24==2))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && (((a24==2) && (input == 1)) && ((124 < a26) && (217 >= a26)) ))) && -84 < a14 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(((((a24==2) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L609] COND FALSE !((((((a24==2) && ( ((134 < a28) && (300 >= a28)) && (input == 2))) && 217 < a26 ) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !(( a28 <= 37 && (( 217 < a26 && ((a24==3) && ((input == 3) && a14 <= -182 ))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(( a21 <= 127 && (((a24==3) && (((input == 4) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 )) && a26 <= -68 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ( a14 <= -182 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))) && (a24==2))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6)) && a14 <= -182 ))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L650] COND FALSE !(((((((a24==3) && (input == 5)) && 217 < a26 ) && a28 <= 37 ) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 2)) && (a24==3))) && ((-68 < a26) && (124 >= a26)) ) && a14 <= -182 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(( 217 < a26 && (((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 4)) && a21 <= 127 ) && (a24==2)) && ((-114 < a14) && (-84 >= a14)) ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((((a24==3) && ( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2))))) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L677] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 5))) && a26 <= -68 ) && a21 <= 127 ) && (a24==2))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L683] COND FALSE !(((((a24==2) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5))) && a21 <= 127 ) && a26 <= -68 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L689] COND FALSE !(( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && ((( 217 < a26 && (input == 3)) && a14 <= -182 ) && (a24==2))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L696] COND FALSE !(((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && ( -84 < a14 && (input == 2)))) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L708] COND FALSE !(((a24==3) && (( ((124 < a26) && (217 >= a26)) && ( -84 < a14 && ( 300 < a28 && (input == 3)))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L713] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 3)) && a26 <= -68 ) && (a24==2)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L719] COND FALSE !(((a24==2) && ( a21 <= 127 && (((input == 5) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( 300 < a28 && ((-182 < a14) && (-114 >= a14)) )) || ( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 ))) && ((-68 < a26) && (124 >= a26)) )))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L729] COND FALSE !(( a21 <= 127 && (( ((-114 < a14) && (-84 >= a14)) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && a26 <= -68 )) && (a24==2)))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !((( a21 <= 127 && ((( 300 < a28 && ( -84 < a14 && ((-68 < a26) && (124 >= a26)) )) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 5))) && (a24==3))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L747] COND FALSE !(((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && ( a28 <= 37 && (((input == 5) && a21 <= 127 ) && ((124 < a26) && (217 >= a26)) ))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !(( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ((a24==2) && (((input == 3) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((((a24==3) && (((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(((a24==2) && (( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && ((input == 4) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !(( a26 <= -68 && ( a21 <= 127 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 2)))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L786] COND FALSE !((((( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 6))) && -84 < a14 ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L791] COND FALSE !((((( -84 < a14 && ( a21 <= 127 && (input == 3))) && a26 <= -68 ) && 300 < a28 ) && (a24==3))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !(((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ( a21 <= 127 && ((( -84 < a14 && ((37 < a28) && (134 >= a28)) ) || (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 ))) && (input == 1)))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( ((37 < a28) && (134 >= a28)) && ((((input == 5) && a21 <= 127 ) && (a24==2)) && -84 < a14 )))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L810] COND FALSE !((((a24==3) && ((((input == 4) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && ((-68 < a26) && (124 >= a26)) ) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !(((((((input == 6) && -84 < a14 ) && a26 <= -68 ) && (a24==3)) && a21 <= 127 ) && 300 < a28 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && (((input == 4) && a28 <= 37 ) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L830] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ((( a26 <= -68 && ((input == 5) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && (a24==3)) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L836] COND FALSE !(((((a24==2) && ((input == 6) && (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 ) && a26 <= -68 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( a21 <= 127 && ( a26 <= -68 && ((a24==3) && ( -84 < a14 && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 6))))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((( a14 <= -182 && (( ((37 < a28) && (134 >= a28)) && ((input == 5) && (a24==2))) && 217 < a26 )) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L857] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 5)) && 217 < a26 ))) && ((-114 < a14) && (-84 >= a14)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !((( a21 <= 127 && ( a14 <= -182 && (( ((134 < a28) && (300 >= a28)) && (input == 3)) && (a24==2)))) && 217 < a26 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((a24==2) && ( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (input == 4)))) && -84 < a14 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L881] COND FALSE !(((((a24==3) && ( ((124 < a26) && (217 >= a26)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a21 <= 127 && (( a14 <= -182 && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && (a24==2)))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !((( a21 <= 127 && (( ((-182 < a14) && (-114 >= a14)) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 1))) && ((124 < a26) && (217 >= a26)) )) && (a24==2))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L894] COND FALSE !(((( ((-68 < a26) && (124 >= a26)) && ( ((-182 < a14) && (-114 >= a14)) && ((input == 5) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==3)) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L901] COND FALSE !(( a21 <= 127 && (((((input == 4) && a26 <= -68 ) && (a24==3)) && -84 < a14 ) && 300 < a28 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L908] COND FALSE !(((a24==2) && (( ((-182 < a14) && (-114 >= a14)) && ( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L919] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ((((input == 4) && a21 <= 127 ) && a14 <= -182 ) && (a24==3))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L923] COND FALSE !((( -84 < a14 && ( a21 <= 127 && ( a28 <= 37 && ((input == 1) && ((-68 < a26) && (124 >= a26)) )))) && (a24==2))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( a21 <= 127 && ( a28 <= 37 && ((( ((-114 < a14) && (-84 >= a14)) && (input == 4)) && ((124 < a26) && (217 >= a26)) ) && (a24==3))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !(((( a28 <= 37 && (( a21 <= 127 && (input == 5)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) ) && (a24==2))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2)) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L949] COND FALSE !((( a21 <= 127 && ((( a28 <= 37 && (input == 2)) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L956] COND FALSE !((( a26 <= -68 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) )) && (input == 3)))) && a21 <= 127 )) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L962] COND FALSE !(( a21 <= 127 && ((input == 6) && ((( ((134 < a28) && (300 >= a28)) && ((a24==2) && ( -84 < a14 && 217 < a26 ))) || ( 300 < a28 && ((a24==2) && ( 217 < a26 && -84 < a14 )))) || (((a24==3) && ( a26 <= -68 && a14 <= -182 )) && a28 <= 37 ))))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( 217 < a26 && ((((a24==3) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 4))) && a14 <= -182 ) && a21 <= 127 ))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !(((((((input == 3) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && a26 <= -68 ) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) ) && (a24==3))) VAL [\old(input)=2, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L982] COND TRUE ( a14 <= -182 && ((((a24==2) && ((input == 2) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a26 <= -68 ) && a21 <= 127 )) [L983] a28 = ((((a28 % 299849)- -300149) - 506398) - -506401) [L984] return 26; VAL [\old(input)=2, \result=26, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(( a21 <= 127 && ((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && (input == 3)) && a21 <= 127 ) && (a24==3)))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((a24==2) && ( 217 < a26 && (((input == 4) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 )))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(( a21 <= 127 && ((( ((-114 < a14) && (-84 >= a14)) && ( ((124 < a26) && (217 >= a26)) && (input == 2))) && (a24==3)) && a28 <= 37 ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==3)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a24==3) && ( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a14 <= -182 ) && 217 < a26 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND FALSE !(( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 6) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a21 <= 127 ) && (a24==2))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L568] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ((((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && a26 <= -68 ) && a21 <= 127 ))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !((((a24==2) && (((input == 2) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 )) || ( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ))) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L580] COND FALSE !((((( -84 < a14 && ((input == 2) && a21 <= 127 )) && a26 <= -68 ) && (a24==2)) && ((37 < a28) && (134 >= a28)) )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)) && ((-182 < a14) && (-114 >= a14)) ))) && a26 <= -68 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (((input == 3) && ((-68 < a26) && (124 >= a26)) ) && 300 < a28 ))) && (a24==2))) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && (((a24==2) && (input == 1)) && ((124 < a26) && (217 >= a26)) ))) && -84 < a14 )) VAL [\old(input)=6, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND TRUE ((((a24==2) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )))) && a26 <= -68 ) && a21 <= 127 ) [L605] a14 = (((((a14 - -113223) + -74409) * 1) % 299909)+ -300090) [L606] a26 = ((((a26 % 95)+ 39) + 32) - 25) [L607] a28 = (((((a28 * 9)/ 10) * 1) % 300018)+ -299980) [L608] return 21; VAL [\old(input)=6, \result=21, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND TRUE ( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 ))) [L273] a26 = (((a26 - -478961) + -415672) + 258271) [L274] a28 = ((((a28 % 299849)- -300149) + 2) * 1) [L275] return 26; VAL [\old(input)=2, \result=26, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(( a21 <= 127 && ((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && (input == 3)) && a21 <= 127 ) && (a24==3)))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((a24==2) && ( 217 < a26 && (((input == 4) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 )))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(( a21 <= 127 && ((( ((-114 < a14) && (-84 >= a14)) && ( ((124 < a26) && (217 >= a26)) && (input == 2))) && (a24==3)) && a28 <= 37 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==3)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a24==3) && ( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a14 <= -182 ) && 217 < a26 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND FALSE !(( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 6) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a21 <= 127 ) && (a24==2))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L568] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ((((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && a26 <= -68 ) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !((((a24==2) && (((input == 2) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 )) || ( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ))) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L580] COND FALSE !((((( -84 < a14 && ((input == 2) && a21 <= 127 )) && a26 <= -68 ) && (a24==2)) && ((37 < a28) && (134 >= a28)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)) && ((-182 < a14) && (-114 >= a14)) ))) && a26 <= -68 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (((input == 3) && ((-68 < a26) && (124 >= a26)) ) && 300 < a28 ))) && (a24==2))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && (((a24==2) && (input == 1)) && ((124 < a26) && (217 >= a26)) ))) && -84 < a14 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(((((a24==2) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )))) && a26 <= -68 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L609] COND FALSE !((((((a24==2) && ( ((134 < a28) && (300 >= a28)) && (input == 2))) && 217 < a26 ) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !(( a28 <= 37 && (( 217 < a26 && ((a24==3) && ((input == 3) && a14 <= -182 ))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(( a21 <= 127 && (((a24==3) && (((input == 4) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 )) && a26 <= -68 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ( a14 <= -182 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))) && (a24==2))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6)) && a14 <= -182 ))) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L650] COND FALSE !(((((((a24==3) && (input == 5)) && 217 < a26 ) && a28 <= 37 ) && a14 <= -182 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 2)) && (a24==3))) && ((-68 < a26) && (124 >= a26)) ) && a14 <= -182 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(( 217 < a26 && (((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 4)) && a21 <= 127 ) && (a24==2)) && ((-114 < a14) && (-84 >= a14)) ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((((a24==3) && ( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2))))) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L677] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 5))) && a26 <= -68 ) && a21 <= 127 ) && (a24==2))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L683] COND FALSE !(((((a24==2) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5))) && a21 <= 127 ) && a26 <= -68 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L689] COND FALSE !(( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && ((( 217 < a26 && (input == 3)) && a14 <= -182 ) && (a24==2))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L696] COND FALSE !(((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && ( -84 < a14 && (input == 2)))) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L708] COND FALSE !(((a24==3) && (( ((124 < a26) && (217 >= a26)) && ( -84 < a14 && ( 300 < a28 && (input == 3)))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L713] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 3)) && a26 <= -68 ) && (a24==2)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L719] COND FALSE !(((a24==2) && ( a21 <= 127 && (((input == 5) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( 300 < a28 && ((-182 < a14) && (-114 >= a14)) )) || ( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 ))) && ((-68 < a26) && (124 >= a26)) )))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L729] COND FALSE !(( a21 <= 127 && (( ((-114 < a14) && (-84 >= a14)) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && a26 <= -68 )) && (a24==2)))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !((( a21 <= 127 && ((( 300 < a28 && ( -84 < a14 && ((-68 < a26) && (124 >= a26)) )) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 5))) && (a24==3))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L747] COND FALSE !(((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && ( a28 <= 37 && (((input == 5) && a21 <= 127 ) && ((124 < a26) && (217 >= a26)) ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !(( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ((a24==2) && (((input == 3) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((((a24==3) && (((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(((a24==2) && (( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && ((input == 4) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && ((-68 < a26) && (124 >= a26)) ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !(( a26 <= -68 && ( a21 <= 127 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 2)))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L786] COND FALSE !((((( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 6))) && -84 < a14 ) && (a24==2)) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L791] COND FALSE !((((( -84 < a14 && ( a21 <= 127 && (input == 3))) && a26 <= -68 ) && 300 < a28 ) && (a24==3))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !(((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ( a21 <= 127 && ((( -84 < a14 && ((37 < a28) && (134 >= a28)) ) || (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 ))) && (input == 1)))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( ((37 < a28) && (134 >= a28)) && ((((input == 5) && a21 <= 127 ) && (a24==2)) && -84 < a14 )))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L810] COND FALSE !((((a24==3) && ((((input == 4) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && ((-68 < a26) && (124 >= a26)) ) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !(((((((input == 6) && -84 < a14 ) && a26 <= -68 ) && (a24==3)) && a21 <= 127 ) && 300 < a28 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && (((input == 4) && a28 <= 37 ) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L830] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ((( a26 <= -68 && ((input == 5) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && (a24==3)) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L836] COND FALSE !(((((a24==2) && ((input == 6) && (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 ) && a26 <= -68 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( a21 <= 127 && ( a26 <= -68 && ((a24==3) && ( -84 < a14 && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 6))))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((( a14 <= -182 && (( ((37 < a28) && (134 >= a28)) && ((input == 5) && (a24==2))) && 217 < a26 )) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L857] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 5)) && 217 < a26 ))) && ((-114 < a14) && (-84 >= a14)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !((( a21 <= 127 && ( a14 <= -182 && (( ((134 < a28) && (300 >= a28)) && (input == 3)) && (a24==2)))) && 217 < a26 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((a24==2) && ( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (input == 4)))) && -84 < a14 ) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L881] COND FALSE !(((((a24==3) && ( ((124 < a26) && (217 >= a26)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a21 <= 127 && (( a14 <= -182 && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && (a24==2)))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !((( a21 <= 127 && (( ((-182 < a14) && (-114 >= a14)) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 1))) && ((124 < a26) && (217 >= a26)) )) && (a24==2))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L894] COND FALSE !(((( ((-68 < a26) && (124 >= a26)) && ( ((-182 < a14) && (-114 >= a14)) && ((input == 5) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==3)) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L901] COND FALSE !(( a21 <= 127 && (((((input == 4) && a26 <= -68 ) && (a24==3)) && -84 < a14 ) && 300 < a28 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L908] COND FALSE !(((a24==2) && (( ((-182 < a14) && (-114 >= a14)) && ( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L919] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ((((input == 4) && a21 <= 127 ) && a14 <= -182 ) && (a24==3))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L923] COND FALSE !((( -84 < a14 && ( a21 <= 127 && ( a28 <= 37 && ((input == 1) && ((-68 < a26) && (124 >= a26)) )))) && (a24==2))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( a21 <= 127 && ( a28 <= 37 && ((( ((-114 < a14) && (-84 >= a14)) && (input == 4)) && ((124 < a26) && (217 >= a26)) ) && (a24==3))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !(((( a28 <= 37 && (( a21 <= 127 && (input == 5)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) ) && (a24==2))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2)) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L949] COND FALSE !((( a21 <= 127 && ((( a28 <= 37 && (input == 2)) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L956] COND FALSE !((( a26 <= -68 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) )) && (input == 3)))) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L962] COND FALSE !(( a21 <= 127 && ((input == 6) && ((( ((134 < a28) && (300 >= a28)) && ((a24==2) && ( -84 < a14 && 217 < a26 ))) || ( 300 < a28 && ((a24==2) && ( 217 < a26 && -84 < a14 )))) || (((a24==3) && ( a26 <= -68 && a14 <= -182 )) && a28 <= 37 ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( 217 < a26 && ((((a24==3) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 4))) && a14 <= -182 ) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !(((((((input == 3) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && a26 <= -68 ) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) ) && (a24==3))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L982] COND FALSE !(( a14 <= -182 && ((((a24==2) && ((input == 2) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a26 <= -68 ) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L985] COND FALSE !(((( 300 < a28 && (((input == 2) && ((-182 < a14) && (-114 >= a14)) ) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L991] COND FALSE !(((a24==2) && (( a21 <= 127 && ((input == 5) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))))) && 217 < a26 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L998] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && ((((input == 4) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 ) && (a24==3))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1005] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && (( ((124 < a26) && (217 >= a26)) && ((input == 1) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))) && (a24==2))) && a21 <= 127 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1009] COND FALSE !((( ((-68 < a26) && (124 >= a26)) && ((((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 ) && (a24==3))) && a14 <= -182 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1015] COND FALSE !((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && ((a24==3) && ((input == 1) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((a24==2) && ( 217 < a26 && ( a21 <= 127 && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((( -84 < a14 && (((a24==3) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 1))) && a21 <= 127 )) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1038] COND FALSE !(((( 217 < a26 && (((a24==3) && (input == 2)) && a14 <= -182 )) && a21 <= 127 ) && a28 <= 37 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1044] COND FALSE !(((((a24==3) && ( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 2)))) && ((124 < a26) && (217 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1050] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && (((input == 6) && (a24==2)) && a28 <= 37 )) && -84 < a14 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((124 < a26) && (217 >= a26)) && ((a24==3) && ( -84 < a14 && (( 300 < a28 && (input == 2)) && a21 <= 127 ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1060] COND FALSE !(((( a28 <= 37 && (((a24==3) && (input == 3)) && a26 <= -68 )) && a21 <= 127 ) && -84 < a14 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1066] COND FALSE !((( ((-182 < a14) && (-114 >= a14)) && ((a24==3) && ( a21 <= 127 && ((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))))) && ((124 < a26) && (217 >= a26)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1073] COND FALSE !(((((((input == 4) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1079] COND FALSE !(((a24==2) && ( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1086] COND FALSE !(( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) && (((input == 3) && (a24==2)) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && (( ((-68 < a26) && (124 >= a26)) && ( 300 < a28 && ((input == 3) && (a24==3)))) && a21 <= 127 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1098] COND FALSE !(( a21 <= 127 && ( ((37 < a28) && (134 >= a28)) && ((a24==3) && (((input == 1) && 217 < a26 ) && a14 <= -182 ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1104] COND FALSE !(((a24==3) && ((( a26 <= -68 && ( -84 < a14 && (input == 1))) && a21 <= 127 ) && 300 < a28 ))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1110] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (((input == 6) && 217 < a26 ) && a21 <= 127 ))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1116] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ((a24==2) && ((input == 2) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))))) && a21 <= 127 ) && 217 < a26 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1123] COND FALSE !((((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 3)) && -84 < a14 ) && a21 <= 127 ) && (a24==3)) && a26 <= -68 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1129] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && (((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 1)) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 ) && (a24==3)))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1135] COND FALSE !(((( a26 <= -68 && ( ((134 < a28) && (300 >= a28)) && ((input == 1) && a21 <= 127 ))) && (a24==2)) && a14 <= -182 )) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1140] COND FALSE !(( a14 <= -182 && ( ((134 < a28) && (300 >= a28)) && (( a21 <= 127 && ((input == 1) && 217 < a26 )) && (a24==2))))) VAL [\old(input)=2, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1145] COND TRUE ((a24==2) && ( a21 <= 127 && (((input == 2) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))) && 217 < a26 ))) [L1146] a14 = ((((a14 / 5) * 4) % 14)- 91) [L1147] a26 = (((a26 - 0) - 600188) - 13) [L1148] a28 = ((((a28 % 82)+ 218) + 87723) + -87723) [L1149] a24 = 1 [L1151] return -1; VAL [\old(input)=2, \result=-1, a14=-99, a21=124, a24=1, a26=-278640, a28=291, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [\old(input)=1, a14=-99, a21=124, a24=1, a26=-278640, a28=291, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=1, a14=-99, a21=124, a24=1, a26=-278640, a28=291, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=1, a14=-99, a21=124, a24=1, a26=-278640, a28=291, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=1, a14=-99, a21=124, a24=1, a26=-278640, a28=291, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [\old(input)=1, a14=-99, a21=124, a24=1, a26=-278640, a28=291, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [\old(input)=1, a14=-99, a21=124, a24=1, a26=-278640, a28=291, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND TRUE (((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 ) VAL [\old(input)=1, a14=-99, a21=124, a24=1, a26=-278640, a28=291, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] reach_error() VAL [\old(input)=1, a14=-99, a21=124, a24=1, a26=-278640, a28=291, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 87.5s, OverallIterations: 24, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 62.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22791 SdHoareTripleChecker+Valid, 52.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22791 mSDsluCounter, 11886 SdHoareTripleChecker+Invalid, 44.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2007 mSDsCounter, 10669 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48673 IncrementalHoareTripleChecker+Invalid, 59342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10669 mSolverCounterUnsat, 9879 mSDtfsCounter, 48673 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4123 GetRequests, 4051 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118847occurred in iteration=23, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 71205 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 9327 NumberOfCodeBlocks, 9327 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 10632 ConstructedInterpolants, 0 QuantifiedInterpolants, 32749 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2810 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 33 InterpolantComputations, 21 PerfectInterpolantSequences, 9909/10757 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-12 01:30:36,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE