./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label40.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/Problem15_label40.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 --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 b8c9f2c9b331909362e118e26998cf544128fea5c4a4aa017adad7b86a38a844
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 10:51:48,599 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 10:51:48,646 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 10:51:48,649 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 10:51:48,651 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 10:51:48,674 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 10:51:48,674 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 10:51:48,674 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 10:51:48,675 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 10:51:48,675 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 10:51:48,675 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 10:51:48,675 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 10:51:48,675 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 10:51:48,675 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 10:51:48,675 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 10:51:48,675 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 10:51:48,675 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 10:51:48,675 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 10:51:48,677 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 10:51:48,677 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:51:48,678 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 10:51:48,678 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b8c9f2c9b331909362e118e26998cf544128fea5c4a4aa017adad7b86a38a844
[2025-03-03 10:51:48,883 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 10:51:48,890 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 10:51:48,892 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 10:51:48,893 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 10:51:48,893 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 10:51:48,893 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label40.c
[2025-03-03 10:51:49,976 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac68c2ab4/53028f4569a3428ab06a549951145efc/FLAG13c1d1500
[2025-03-03 10:51:50,331 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 10:51:50,332 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label40.c
[2025-03-03 10:51:50,350 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac68c2ab4/53028f4569a3428ab06a549951145efc/FLAG13c1d1500
[2025-03-03 10:51:50,545 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac68c2ab4/53028f4569a3428ab06a549951145efc
[2025-03-03 10:51:50,547 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 10:51:50,548 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 10:51:50,549 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 10:51:50,549 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 10:51:50,552 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 10:51:50,552 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:51:50" (1/1) ...
[2025-03-03 10:51:50,552 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:50, skipping insertion in model container
[2025-03-03 10:51:50,553 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:51:50" (1/1) ...
[2025-03-03 10:51:50,590 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 10:51:50,720 WARN  L250   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/Problem15_label40.c[3333,3346]
[2025-03-03 10:51:50,957 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:51:50,964 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 10:51:50,975 WARN  L250   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/Problem15_label40.c[3333,3346]
[2025-03-03 10:51:51,113 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:51:51,126 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 10:51:51,127 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51 WrapperNode
[2025-03-03 10:51:51,127 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 10:51:51,128 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 10:51:51,128 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 10:51:51,128 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 10:51:51,132 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,159 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,283 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757
[2025-03-03 10:51:51,284 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 10:51:51,284 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 10:51:51,285 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 10:51:51,285 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 10:51:51,290 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,291 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,315 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,399 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 10:51:51,399 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,399 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,448 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,456 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,468 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,476 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,500 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 10:51:51,501 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 10:51:51,502 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 10:51:51,502 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 10:51:51,503 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (1/1) ...
[2025-03-03 10:51:51,506 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:51:51,542 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:51:51,555 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 10:51:51,560 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 10:51:51,575 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 10:51:51,575 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 10:51:51,575 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 10:51:51,575 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 10:51:51,626 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 10:51:51,628 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 10:51:53,523 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1;
[2025-03-03 10:51:53,580 INFO  L?                        ?]: Removed 246 outVars from TransFormulas that were not future-live.
[2025-03-03 10:51:53,580 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 10:51:53,593 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 10:51:53,593 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 10:51:53,593 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:51:53 BoogieIcfgContainer
[2025-03-03 10:51:53,593 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 10:51:53,599 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 10:51:53,599 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 10:51:53,602 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 10:51:53,602 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:51:50" (1/3) ...
[2025-03-03 10:51:53,603 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c97bbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:51:53, skipping insertion in model container
[2025-03-03 10:51:53,603 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:51:51" (2/3) ...
[2025-03-03 10:51:53,604 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c97bbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:51:53, skipping insertion in model container
[2025-03-03 10:51:53,604 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:51:53" (3/3) ...
[2025-03-03 10:51:53,605 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem15_label40.c
[2025-03-03 10:51:53,616 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 10:51:53,618 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label40.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 10:51:53,672 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 10:51:53,679 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c5fb016, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 10:51:53,679 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 10:51:53,683 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 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)
[2025-03-03 10:51:53,686 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2025-03-03 10:51:53,686 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:51:53,687 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:51:53,687 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:51:53,690 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:51:53,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 1516487648, now seen corresponding path program 1 times
[2025-03-03 10:51:53,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:51:53,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113571978]
[2025-03-03 10:51:53,696 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:51:53,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:51:53,745 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-03-03 10:51:53,766 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-03-03 10:51:53,768 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:51:53,769 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:51:53,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:51:53,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:51:53,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113571978]
[2025-03-03 10:51:53,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113571978] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:51:53,877 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:51:53,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:51:53,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487375106]
[2025-03-03 10:51:53,879 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:51:53,885 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:51:53,885 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:51:53,896 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:51:53,896 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:51:53,898 INFO  L87              Difference]: Start difference. First operand  has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 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 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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)
[2025-03-03 10:51:55,340 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:51:55,340 INFO  L93              Difference]: Finished difference Result 1154 states and 2103 transitions.
[2025-03-03 10:51:55,341 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:51:55,342 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 26
[2025-03-03 10:51:55,342 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:51:55,350 INFO  L225             Difference]: With dead ends: 1154
[2025-03-03 10:51:55,350 INFO  L226             Difference]: Without dead ends: 665
[2025-03-03 10:51:55,353 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:51:55,355 INFO  L435           NwaCegarLoop]: 336 mSDtfsCounter, 295 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 10:51:55,355 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 385 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 10:51:55,366 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 665 states.
[2025-03-03 10:51:55,398 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663.
[2025-03-03 10:51:55,401 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 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)
[2025-03-03 10:51:55,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions.
[2025-03-03 10:51:55,409 INFO  L78                 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 26
[2025-03-03 10:51:55,409 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:51:55,409 INFO  L471      AbstractCegarLoop]: Abstraction has 663 states and 981 transitions.
[2025-03-03 10:51:55,409 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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)
[2025-03-03 10:51:55,409 INFO  L276                IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions.
[2025-03-03 10:51:55,411 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-03-03 10:51:55,411 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:51:55,411 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 10:51:55,411 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 10:51:55,411 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:51:55,412 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:51:55,412 INFO  L85        PathProgramCache]: Analyzing trace with hash -1504703356, now seen corresponding path program 1 times
[2025-03-03 10:51:55,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:51:55,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432893072]
[2025-03-03 10:51:55,412 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:51:55,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:51:55,429 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-03-03 10:51:55,477 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-03-03 10:51:55,478 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:51:55,478 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:51:55,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:51:55,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:51:55,835 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432893072]
[2025-03-03 10:51:55,835 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432893072] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:51:55,836 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:51:55,836 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:51:55,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602477950]
[2025-03-03 10:51:55,837 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:51:55,837 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:51:55,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:51:55,838 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:51:55,839 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:51:55,839 INFO  L87              Difference]: Start difference. First operand 663 states and 981 transitions. Second operand  has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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)
[2025-03-03 10:51:56,931 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:51:56,931 INFO  L93              Difference]: Finished difference Result 1624 states and 2315 transitions.
[2025-03-03 10:51:56,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:51:56,932 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 91
[2025-03-03 10:51:56,933 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:51:56,936 INFO  L225             Difference]: With dead ends: 1624
[2025-03-03 10:51:56,936 INFO  L226             Difference]: Without dead ends: 963
[2025-03-03 10:51:56,937 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:51:56,940 INFO  L435           NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:51:56,940 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 10:51:56,944 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 963 states.
[2025-03-03 10:51:56,965 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963.
[2025-03-03 10:51:56,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 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)
[2025-03-03 10:51:56,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions.
[2025-03-03 10:51:56,972 INFO  L78                 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 91
[2025-03-03 10:51:56,972 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:51:56,973 INFO  L471      AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions.
[2025-03-03 10:51:56,973 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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)
[2025-03-03 10:51:56,973 INFO  L276                IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions.
[2025-03-03 10:51:56,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2025-03-03 10:51:56,976 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:51:56,976 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 10:51:56,976 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 10:51:56,976 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:51:56,977 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:51:56,978 INFO  L85        PathProgramCache]: Analyzing trace with hash 648093529, now seen corresponding path program 1 times
[2025-03-03 10:51:56,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:51:56,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605116208]
[2025-03-03 10:51:56,978 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:51:56,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:51:56,992 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes.
[2025-03-03 10:51:57,004 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements.
[2025-03-03 10:51:57,004 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:51:57,004 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:51:57,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:51:57,199 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:51:57,199 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605116208]
[2025-03-03 10:51:57,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605116208] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:51:57,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:51:57,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:51:57,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214305436]
[2025-03-03 10:51:57,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:51:57,200 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 10:51:57,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:51:57,200 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 10:51:57,200 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:51:57,200 INFO  L87              Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand  has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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)
[2025-03-03 10:51:58,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:51:58,498 INFO  L93              Difference]: Finished difference Result 2240 states and 3197 transitions.
[2025-03-03 10:51:58,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:51:58,499 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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 96
[2025-03-03 10:51:58,499 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:51:58,503 INFO  L225             Difference]: With dead ends: 2240
[2025-03-03 10:51:58,503 INFO  L226             Difference]: Without dead ends: 1578
[2025-03-03 10:51:58,504 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:51:58,505 INFO  L435           NwaCegarLoop]: 272 mSDtfsCounter, 939 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 10:51:58,505 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 324 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 10:51:58,506 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1578 states.
[2025-03-03 10:51:58,519 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1266.
[2025-03-03 10:51:58,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1266 states, 1265 states have (on average 1.3051383399209486) internal successors, (1651), 1265 states have internal predecessors, (1651), 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)
[2025-03-03 10:51:58,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1651 transitions.
[2025-03-03 10:51:58,524 INFO  L78                 Accepts]: Start accepts. Automaton has 1266 states and 1651 transitions. Word has length 96
[2025-03-03 10:51:58,524 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:51:58,524 INFO  L471      AbstractCegarLoop]: Abstraction has 1266 states and 1651 transitions.
[2025-03-03 10:51:58,524 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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)
[2025-03-03 10:51:58,524 INFO  L276                IsEmpty]: Start isEmpty. Operand 1266 states and 1651 transitions.
[2025-03-03 10:51:58,526 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-03-03 10:51:58,527 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:51:58,527 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 10:51:58,527 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 10:51:58,527 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:51:58,528 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:51:58,529 INFO  L85        PathProgramCache]: Analyzing trace with hash -457375717, now seen corresponding path program 1 times
[2025-03-03 10:51:58,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:51:58,529 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343542771]
[2025-03-03 10:51:58,529 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:51:58,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:51:58,547 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-03 10:51:58,563 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-03 10:51:58,563 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:51:58,563 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:51:58,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:51:58,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:51:58,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343542771]
[2025-03-03 10:51:58,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343542771] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:51:58,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:51:58,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:51:58,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290844628]
[2025-03-03 10:51:58,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:51:58,687 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:51:58,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:51:58,688 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:51:58,688 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:51:58,688 INFO  L87              Difference]: Start difference. First operand 1266 states and 1651 transitions. Second operand  has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 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)
[2025-03-03 10:52:01,232 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:01,232 INFO  L93              Difference]: Finished difference Result 4670 states and 6174 transitions.
[2025-03-03 10:52:01,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:52:01,233 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 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
[2025-03-03 10:52:01,233 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:01,244 INFO  L225             Difference]: With dead ends: 4670
[2025-03-03 10:52:01,244 INFO  L226             Difference]: Without dead ends: 3406
[2025-03-03 10:52:01,245 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:52:01,247 INFO  L435           NwaCegarLoop]: 289 mSDtfsCounter, 537 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:01,248 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 374 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-03-03 10:52:01,250 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3406 states.
[2025-03-03 10:52:01,282 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381.
[2025-03-03 10:52:01,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3381 states, 3380 states have (on average 1.2372781065088758) internal successors, (4182), 3380 states have internal predecessors, (4182), 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)
[2025-03-03 10:52:01,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4182 transitions.
[2025-03-03 10:52:01,292 INFO  L78                 Accepts]: Start accepts. Automaton has 3381 states and 4182 transitions. Word has length 117
[2025-03-03 10:52:01,292 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:01,292 INFO  L471      AbstractCegarLoop]: Abstraction has 3381 states and 4182 transitions.
[2025-03-03 10:52:01,293 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 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)
[2025-03-03 10:52:01,293 INFO  L276                IsEmpty]: Start isEmpty. Operand 3381 states and 4182 transitions.
[2025-03-03 10:52:01,294 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 184
[2025-03-03 10:52:01,294 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:01,294 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:01,294 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 10:52:01,295 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:01,295 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:01,295 INFO  L85        PathProgramCache]: Analyzing trace with hash 1688787008, now seen corresponding path program 1 times
[2025-03-03 10:52:01,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:01,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531620260]
[2025-03-03 10:52:01,295 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:01,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:01,312 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes.
[2025-03-03 10:52:01,326 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements.
[2025-03-03 10:52:01,326 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:01,326 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:01,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2025-03-03 10:52:01,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:01,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531620260]
[2025-03-03 10:52:01,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531620260] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:01,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:01,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:52:01,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413878667]
[2025-03-03 10:52:01,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:01,440 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:01,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:01,441 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:01,441 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:01,442 INFO  L87              Difference]: Start difference. First operand 3381 states and 4182 transitions. Second operand  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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)
[2025-03-03 10:52:02,445 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:02,445 INFO  L93              Difference]: Finished difference Result 8563 states and 10760 transitions.
[2025-03-03 10:52:02,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:02,446 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 183
[2025-03-03 10:52:02,446 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:02,466 INFO  L225             Difference]: With dead ends: 8563
[2025-03-03 10:52:02,467 INFO  L226             Difference]: Without dead ends: 5483
[2025-03-03 10:52:02,473 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:02,474 INFO  L435           NwaCegarLoop]: 271 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:02,474 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 338 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 10:52:02,478 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5483 states.
[2025-03-03 10:52:02,524 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478.
[2025-03-03 10:52:02,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5478 states, 5477 states have (on average 1.1694358225305825) internal successors, (6405), 5477 states have internal predecessors, (6405), 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)
[2025-03-03 10:52:02,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6405 transitions.
[2025-03-03 10:52:02,537 INFO  L78                 Accepts]: Start accepts. Automaton has 5478 states and 6405 transitions. Word has length 183
[2025-03-03 10:52:02,538 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:02,538 INFO  L471      AbstractCegarLoop]: Abstraction has 5478 states and 6405 transitions.
[2025-03-03 10:52:02,538 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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)
[2025-03-03 10:52:02,538 INFO  L276                IsEmpty]: Start isEmpty. Operand 5478 states and 6405 transitions.
[2025-03-03 10:52:02,541 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2025-03-03 10:52:02,542 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:02,542 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:02,542 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 10:52:02,542 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:02,542 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:02,542 INFO  L85        PathProgramCache]: Analyzing trace with hash -1284185541, now seen corresponding path program 1 times
[2025-03-03 10:52:02,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:02,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749686818]
[2025-03-03 10:52:02,543 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:02,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:02,562 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes.
[2025-03-03 10:52:02,580 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements.
[2025-03-03 10:52:02,582 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:02,582 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:02,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:52:02,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:02,894 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749686818]
[2025-03-03 10:52:02,894 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749686818] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:02,895 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:02,895 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:52:02,895 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740467300]
[2025-03-03 10:52:02,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:02,897 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:02,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:02,898 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:02,899 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:02,899 INFO  L87              Difference]: Start difference. First operand 5478 states and 6405 transitions. Second operand  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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)
[2025-03-03 10:52:03,946 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:03,946 INFO  L93              Difference]: Finished difference Result 10655 states and 12497 transitions.
[2025-03-03 10:52:03,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:03,947 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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 184
[2025-03-03 10:52:03,947 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:03,958 INFO  L225             Difference]: With dead ends: 10655
[2025-03-03 10:52:03,958 INFO  L226             Difference]: Without dead ends: 5478
[2025-03-03 10:52:03,963 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:03,964 INFO  L435           NwaCegarLoop]: 324 mSDtfsCounter, 143 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:03,964 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 10:52:03,967 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5478 states.
[2025-03-03 10:52:04,009 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478.
[2025-03-03 10:52:04,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 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)
[2025-03-03 10:52:04,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions.
[2025-03-03 10:52:04,022 INFO  L78                 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 184
[2025-03-03 10:52:04,023 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:04,023 INFO  L471      AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions.
[2025-03-03 10:52:04,023 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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)
[2025-03-03 10:52:04,023 INFO  L276                IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions.
[2025-03-03 10:52:04,024 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2025-03-03 10:52:04,024 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:04,025 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:04,025 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 10:52:04,025 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:04,025 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:04,025 INFO  L85        PathProgramCache]: Analyzing trace with hash -1547259092, now seen corresponding path program 1 times
[2025-03-03 10:52:04,025 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:04,025 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992619023]
[2025-03-03 10:52:04,026 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:04,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:04,069 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-03-03 10:52:04,081 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-03-03 10:52:04,081 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:04,082 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:04,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:52:04,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:04,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992619023]
[2025-03-03 10:52:04,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992619023] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:04,200 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:04,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:04,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902846325]
[2025-03-03 10:52:04,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:04,201 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:52:04,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:04,202 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:52:04,202 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:52:04,202 INFO  L87              Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand  has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:52:06,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:06,800 INFO  L93              Difference]: Finished difference Result 12184 states and 14319 transitions.
[2025-03-03 10:52:06,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:52:06,801 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202
[2025-03-03 10:52:06,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:06,815 INFO  L225             Difference]: With dead ends: 12184
[2025-03-03 10:52:06,815 INFO  L226             Difference]: Without dead ends: 7007
[2025-03-03 10:52:06,818 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:52:06,819 INFO  L435           NwaCegarLoop]: 299 mSDtfsCounter, 458 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:06,819 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 353 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-03-03 10:52:06,824 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7007 states.
[2025-03-03 10:52:06,869 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7007 to 5786.
[2025-03-03 10:52:06,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5786 states, 5785 states have (on average 1.1799481417458946) internal successors, (6826), 5785 states have internal predecessors, (6826), 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)
[2025-03-03 10:52:06,883 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5786 states to 5786 states and 6826 transitions.
[2025-03-03 10:52:06,884 INFO  L78                 Accepts]: Start accepts. Automaton has 5786 states and 6826 transitions. Word has length 202
[2025-03-03 10:52:06,884 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:06,884 INFO  L471      AbstractCegarLoop]: Abstraction has 5786 states and 6826 transitions.
[2025-03-03 10:52:06,884 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:52:06,884 INFO  L276                IsEmpty]: Start isEmpty. Operand 5786 states and 6826 transitions.
[2025-03-03 10:52:06,886 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2025-03-03 10:52:06,886 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:06,886 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:06,886 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 10:52:06,887 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:06,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:06,888 INFO  L85        PathProgramCache]: Analyzing trace with hash -1942400017, now seen corresponding path program 1 times
[2025-03-03 10:52:06,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:06,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274237887]
[2025-03-03 10:52:06,888 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:06,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:06,912 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes.
[2025-03-03 10:52:06,924 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements.
[2025-03-03 10:52:06,925 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:06,925 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:07,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:52:07,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:07,150 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274237887]
[2025-03-03 10:52:07,150 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274237887] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:07,150 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:07,150 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:07,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623866865]
[2025-03-03 10:52:07,151 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:07,151 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:52:07,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:07,151 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:52:07,151 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:52:07,152 INFO  L87              Difference]: Start difference. First operand 5786 states and 6826 transitions. Second operand  has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 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)
[2025-03-03 10:52:09,070 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:09,070 INFO  L93              Difference]: Finished difference Result 13094 states and 15499 transitions.
[2025-03-03 10:52:09,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:52:09,071 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 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 259
[2025-03-03 10:52:09,071 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:09,087 INFO  L225             Difference]: With dead ends: 13094
[2025-03-03 10:52:09,088 INFO  L226             Difference]: Without dead ends: 7609
[2025-03-03 10:52:09,093 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:52:09,094 INFO  L435           NwaCegarLoop]: 307 mSDtfsCounter, 399 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:09,094 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 390 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-03 10:52:09,099 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7609 states.
[2025-03-03 10:52:09,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7609 to 6086.
[2025-03-03 10:52:09,184 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6086 states, 6085 states have (on average 1.1750205423171733) internal successors, (7150), 6085 states have internal predecessors, (7150), 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)
[2025-03-03 10:52:09,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 7150 transitions.
[2025-03-03 10:52:09,192 INFO  L78                 Accepts]: Start accepts. Automaton has 6086 states and 7150 transitions. Word has length 259
[2025-03-03 10:52:09,194 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:09,194 INFO  L471      AbstractCegarLoop]: Abstraction has 6086 states and 7150 transitions.
[2025-03-03 10:52:09,194 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 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)
[2025-03-03 10:52:09,195 INFO  L276                IsEmpty]: Start isEmpty. Operand 6086 states and 7150 transitions.
[2025-03-03 10:52:09,197 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 314
[2025-03-03 10:52:09,198 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:09,198 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:09,198 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 10:52:09,198 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:09,199 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:09,199 INFO  L85        PathProgramCache]: Analyzing trace with hash 52714256, now seen corresponding path program 1 times
[2025-03-03 10:52:09,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:09,199 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141959444]
[2025-03-03 10:52:09,199 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:09,199 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:09,224 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes.
[2025-03-03 10:52:09,237 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements.
[2025-03-03 10:52:09,238 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:09,238 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:09,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 137 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-03-03 10:52:09,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:09,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141959444]
[2025-03-03 10:52:09,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141959444] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:09,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:09,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:09,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284278316]
[2025-03-03 10:52:09,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:09,357 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:09,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:09,358 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:09,358 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:09,363 INFO  L87              Difference]: Start difference. First operand 6086 states and 7150 transitions. Second operand  has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:52:10,563 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:10,563 INFO  L93              Difference]: Finished difference Result 14273 states and 17120 transitions.
[2025-03-03 10:52:10,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:10,565 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 313
[2025-03-03 10:52:10,566 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:10,580 INFO  L225             Difference]: With dead ends: 14273
[2025-03-03 10:52:10,580 INFO  L226             Difference]: Without dead ends: 8488
[2025-03-03 10:52:10,585 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:10,589 INFO  L435           NwaCegarLoop]: 632 mSDtfsCounter, 290 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:10,589 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 10:52:10,595 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8488 states.
[2025-03-03 10:52:10,671 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8488 to 8484.
[2025-03-03 10:52:10,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8484 states, 8483 states have (on average 1.1478250618884829) internal successors, (9737), 8483 states have internal predecessors, (9737), 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)
[2025-03-03 10:52:10,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 9737 transitions.
[2025-03-03 10:52:10,691 INFO  L78                 Accepts]: Start accepts. Automaton has 8484 states and 9737 transitions. Word has length 313
[2025-03-03 10:52:10,691 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:10,691 INFO  L471      AbstractCegarLoop]: Abstraction has 8484 states and 9737 transitions.
[2025-03-03 10:52:10,691 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:52:10,692 INFO  L276                IsEmpty]: Start isEmpty. Operand 8484 states and 9737 transitions.
[2025-03-03 10:52:10,696 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 373
[2025-03-03 10:52:10,696 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:10,696 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:10,696 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 10:52:10,696 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:10,699 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:10,699 INFO  L85        PathProgramCache]: Analyzing trace with hash -1349560205, now seen corresponding path program 1 times
[2025-03-03 10:52:10,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:10,700 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862669375]
[2025-03-03 10:52:10,700 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:10,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:10,727 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes.
[2025-03-03 10:52:10,742 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements.
[2025-03-03 10:52:10,742 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:10,742 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:10,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 122 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-03-03 10:52:10,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:10,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862669375]
[2025-03-03 10:52:10,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862669375] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:10,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:10,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:10,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815020138]
[2025-03-03 10:52:10,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:10,903 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:10,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:10,903 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:10,903 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:10,903 INFO  L87              Difference]: Start difference. First operand 8484 states and 9737 transitions. Second operand  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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)
[2025-03-03 10:52:12,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:12,005 INFO  L93              Difference]: Finished difference Result 19663 states and 22941 transitions.
[2025-03-03 10:52:12,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:12,005 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 372
[2025-03-03 10:52:12,006 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:12,019 INFO  L225             Difference]: With dead ends: 19663
[2025-03-03 10:52:12,019 INFO  L226             Difference]: Without dead ends: 11480
[2025-03-03 10:52:12,026 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:12,026 INFO  L435           NwaCegarLoop]: 597 mSDtfsCounter, 301 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:12,026 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 634 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 10:52:12,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11480 states.
[2025-03-03 10:52:12,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11480 to 10583.
[2025-03-03 10:52:12,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10583 states, 10582 states have (on average 1.1332451332451332) internal successors, (11992), 10582 states have internal predecessors, (11992), 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)
[2025-03-03 10:52:12,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 11992 transitions.
[2025-03-03 10:52:12,103 INFO  L78                 Accepts]: Start accepts. Automaton has 10583 states and 11992 transitions. Word has length 372
[2025-03-03 10:52:12,103 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:12,103 INFO  L471      AbstractCegarLoop]: Abstraction has 10583 states and 11992 transitions.
[2025-03-03 10:52:12,103 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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)
[2025-03-03 10:52:12,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 10583 states and 11992 transitions.
[2025-03-03 10:52:12,107 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 374
[2025-03-03 10:52:12,107 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:12,107 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:12,107 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 10:52:12,107 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:12,108 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:12,108 INFO  L85        PathProgramCache]: Analyzing trace with hash -276177507, now seen corresponding path program 1 times
[2025-03-03 10:52:12,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:12,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23789756]
[2025-03-03 10:52:12,108 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:12,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:12,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes.
[2025-03-03 10:52:12,160 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements.
[2025-03-03 10:52:12,160 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:12,160 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:12,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2025-03-03 10:52:12,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:12,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23789756]
[2025-03-03 10:52:12,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23789756] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:12,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:12,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:12,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106497219]
[2025-03-03 10:52:12,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:12,384 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:12,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:12,385 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:12,385 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:12,385 INFO  L87              Difference]: Start difference. First operand 10583 states and 11992 transitions. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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)
[2025-03-03 10:52:13,420 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:13,421 INFO  L93              Difference]: Finished difference Result 26555 states and 30134 transitions.
[2025-03-03 10:52:13,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:13,421 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 373
[2025-03-03 10:52:13,422 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:13,440 INFO  L225             Difference]: With dead ends: 26555
[2025-03-03 10:52:13,440 INFO  L226             Difference]: Without dead ends: 13283
[2025-03-03 10:52:13,451 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:13,452 INFO  L435           NwaCegarLoop]: 580 mSDtfsCounter, 317 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:13,453 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 621 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 10:52:13,463 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13283 states.
[2025-03-03 10:52:13,583 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13283 to 12683.
[2025-03-03 10:52:13,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12683 states, 12682 states have (on average 1.0920990380066236) internal successors, (13850), 12682 states have internal predecessors, (13850), 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)
[2025-03-03 10:52:13,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12683 states to 12683 states and 13850 transitions.
[2025-03-03 10:52:13,605 INFO  L78                 Accepts]: Start accepts. Automaton has 12683 states and 13850 transitions. Word has length 373
[2025-03-03 10:52:13,606 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:13,606 INFO  L471      AbstractCegarLoop]: Abstraction has 12683 states and 13850 transitions.
[2025-03-03 10:52:13,606 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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)
[2025-03-03 10:52:13,606 INFO  L276                IsEmpty]: Start isEmpty. Operand 12683 states and 13850 transitions.
[2025-03-03 10:52:13,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 390
[2025-03-03 10:52:13,608 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:13,608 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:13,608 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 10:52:13,608 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:13,608 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:13,608 INFO  L85        PathProgramCache]: Analyzing trace with hash -262006544, now seen corresponding path program 1 times
[2025-03-03 10:52:13,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:13,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326416356]
[2025-03-03 10:52:13,609 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:13,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:13,636 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes.
[2025-03-03 10:52:13,650 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements.
[2025-03-03 10:52:13,651 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:13,651 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:13,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:52:13,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:13,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326416356]
[2025-03-03 10:52:13,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326416356] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:13,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:13,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:13,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581936338]
[2025-03-03 10:52:13,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:13,780 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:13,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:13,781 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:13,781 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:13,781 INFO  L87              Difference]: Start difference. First operand 12683 states and 13850 transitions. Second operand  has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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)
[2025-03-03 10:52:14,965 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:14,966 INFO  L93              Difference]: Finished difference Result 26870 states and 29656 transitions.
[2025-03-03 10:52:14,966 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:14,966 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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 389
[2025-03-03 10:52:14,967 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:14,981 INFO  L225             Difference]: With dead ends: 26870
[2025-03-03 10:52:14,981 INFO  L226             Difference]: Without dead ends: 14488
[2025-03-03 10:52:14,992 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:14,992 INFO  L435           NwaCegarLoop]: 541 mSDtfsCounter, 246 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:14,993 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 579 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 10:52:15,000 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14488 states.
[2025-03-03 10:52:15,105 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14488 to 13577.
[2025-03-03 10:52:15,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13577 states, 13576 states have (on average 1.0816882734236888) internal successors, (14685), 13576 states have internal predecessors, (14685), 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)
[2025-03-03 10:52:15,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 14685 transitions.
[2025-03-03 10:52:15,128 INFO  L78                 Accepts]: Start accepts. Automaton has 13577 states and 14685 transitions. Word has length 389
[2025-03-03 10:52:15,129 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:15,129 INFO  L471      AbstractCegarLoop]: Abstraction has 13577 states and 14685 transitions.
[2025-03-03 10:52:15,129 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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)
[2025-03-03 10:52:15,129 INFO  L276                IsEmpty]: Start isEmpty. Operand 13577 states and 14685 transitions.
[2025-03-03 10:52:15,131 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 452
[2025-03-03 10:52:15,131 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:15,132 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:15,132 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 10:52:15,132 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:15,133 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:15,133 INFO  L85        PathProgramCache]: Analyzing trace with hash 1478820957, now seen corresponding path program 1 times
[2025-03-03 10:52:15,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:15,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145266606]
[2025-03-03 10:52:15,133 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:15,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:15,164 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes.
[2025-03-03 10:52:15,184 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements.
[2025-03-03 10:52:15,184 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:15,184 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:15,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 189 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked.
[2025-03-03 10:52:15,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:15,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145266606]
[2025-03-03 10:52:15,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145266606] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:15,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:15,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:15,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448456440]
[2025-03-03 10:52:15,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:15,372 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:15,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:15,372 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:15,372 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:15,372 INFO  L87              Difference]: Start difference. First operand 13577 states and 14685 transitions. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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)
[2025-03-03 10:52:16,542 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:16,542 INFO  L93              Difference]: Finished difference Result 26863 states and 29083 transitions.
[2025-03-03 10:52:16,542 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:16,542 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 451
[2025-03-03 10:52:16,543 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:16,554 INFO  L225             Difference]: With dead ends: 26863
[2025-03-03 10:52:16,554 INFO  L226             Difference]: Without dead ends: 13587
[2025-03-03 10:52:16,562 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:16,562 INFO  L435           NwaCegarLoop]: 558 mSDtfsCounter, 299 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:16,562 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 596 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 10:52:16,569 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13587 states.
[2025-03-03 10:52:16,631 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13587 to 10881.
[2025-03-03 10:52:16,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10881 states, 10880 states have (on average 1.0875) internal successors, (11832), 10880 states have internal predecessors, (11832), 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)
[2025-03-03 10:52:16,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10881 states to 10881 states and 11832 transitions.
[2025-03-03 10:52:16,649 INFO  L78                 Accepts]: Start accepts. Automaton has 10881 states and 11832 transitions. Word has length 451
[2025-03-03 10:52:16,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:16,650 INFO  L471      AbstractCegarLoop]: Abstraction has 10881 states and 11832 transitions.
[2025-03-03 10:52:16,650 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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)
[2025-03-03 10:52:16,650 INFO  L276                IsEmpty]: Start isEmpty. Operand 10881 states and 11832 transitions.
[2025-03-03 10:52:16,654 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 528
[2025-03-03 10:52:16,655 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:16,655 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:16,655 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 10:52:16,655 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:16,656 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:16,658 INFO  L85        PathProgramCache]: Analyzing trace with hash -281430737, now seen corresponding path program 1 times
[2025-03-03 10:52:16,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:16,662 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408417517]
[2025-03-03 10:52:16,662 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:16,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:16,741 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes.
[2025-03-03 10:52:16,774 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements.
[2025-03-03 10:52:16,774 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:16,774 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:16,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 405 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked.
[2025-03-03 10:52:16,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:16,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408417517]
[2025-03-03 10:52:16,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408417517] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:16,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:16,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:16,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225678269]
[2025-03-03 10:52:16,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:16,935 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:16,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:16,935 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:16,935 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:16,936 INFO  L87              Difference]: Start difference. First operand 10881 states and 11832 transitions. Second operand  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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)
[2025-03-03 10:52:17,742 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:17,743 INFO  L93              Difference]: Finished difference Result 21757 states and 23702 transitions.
[2025-03-03 10:52:17,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:17,743 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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 527
[2025-03-03 10:52:17,744 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:17,753 INFO  L225             Difference]: With dead ends: 21757
[2025-03-03 10:52:17,753 INFO  L226             Difference]: Without dead ends: 11177
[2025-03-03 10:52:17,759 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:17,759 INFO  L435           NwaCegarLoop]: 66 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:17,759 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 71 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:52:17,765 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11177 states.
[2025-03-03 10:52:17,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 10877.
[2025-03-03 10:52:17,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10877 states, 10876 states have (on average 1.0872563442442074) internal successors, (11825), 10876 states have internal predecessors, (11825), 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)
[2025-03-03 10:52:17,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10877 states to 10877 states and 11825 transitions.
[2025-03-03 10:52:17,834 INFO  L78                 Accepts]: Start accepts. Automaton has 10877 states and 11825 transitions. Word has length 527
[2025-03-03 10:52:17,834 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:17,834 INFO  L471      AbstractCegarLoop]: Abstraction has 10877 states and 11825 transitions.
[2025-03-03 10:52:17,834 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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)
[2025-03-03 10:52:17,834 INFO  L276                IsEmpty]: Start isEmpty. Operand 10877 states and 11825 transitions.
[2025-03-03 10:52:17,837 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 537
[2025-03-03 10:52:17,838 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:17,838 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:17,838 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 10:52:17,838 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:17,838 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:17,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -1019889701, now seen corresponding path program 1 times
[2025-03-03 10:52:17,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:17,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232775352]
[2025-03-03 10:52:17,839 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:17,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:17,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes.
[2025-03-03 10:52:17,889 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements.
[2025-03-03 10:52:17,890 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:17,890 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:18,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 530 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked.
[2025-03-03 10:52:18,007 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:18,008 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232775352]
[2025-03-03 10:52:18,008 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232775352] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:18,008 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:18,008 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:18,008 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721829004]
[2025-03-03 10:52:18,008 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:18,008 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:18,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:18,009 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:18,009 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:18,009 INFO  L87              Difference]: Start difference. First operand 10877 states and 11825 transitions. Second operand  has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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)
[2025-03-03 10:52:18,770 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:18,770 INFO  L93              Difference]: Finished difference Result 24742 states and 27088 transitions.
[2025-03-03 10:52:18,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:18,770 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 536
[2025-03-03 10:52:18,771 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:18,784 INFO  L225             Difference]: With dead ends: 24742
[2025-03-03 10:52:18,784 INFO  L226             Difference]: Without dead ends: 13269
[2025-03-03 10:52:18,793 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:18,793 INFO  L435           NwaCegarLoop]: 226 mSDtfsCounter, 266 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:18,793 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 288 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:52:18,802 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13269 states.
[2025-03-03 10:52:18,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13269 to 9376.
[2025-03-03 10:52:18,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9376 states, 9375 states have (on average 1.07968) internal successors, (10122), 9375 states have internal predecessors, (10122), 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)
[2025-03-03 10:52:18,878 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9376 states to 9376 states and 10122 transitions.
[2025-03-03 10:52:18,879 INFO  L78                 Accepts]: Start accepts. Automaton has 9376 states and 10122 transitions. Word has length 536
[2025-03-03 10:52:18,879 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:18,879 INFO  L471      AbstractCegarLoop]: Abstraction has 9376 states and 10122 transitions.
[2025-03-03 10:52:18,879 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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)
[2025-03-03 10:52:18,879 INFO  L276                IsEmpty]: Start isEmpty. Operand 9376 states and 10122 transitions.
[2025-03-03 10:52:18,883 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 568
[2025-03-03 10:52:18,883 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:18,883 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:18,883 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 10:52:18,884 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:18,884 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:18,884 INFO  L85        PathProgramCache]: Analyzing trace with hash -2026452845, now seen corresponding path program 1 times
[2025-03-03 10:52:18,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:18,884 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180115469]
[2025-03-03 10:52:18,884 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:18,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:18,922 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes.
[2025-03-03 10:52:18,944 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements.
[2025-03-03 10:52:18,944 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:18,944 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:19,533 INFO  L134       CoverageAnalysis]: Checked inductivity of 447 backedges. 48 proven. 227 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked.
[2025-03-03 10:52:19,533 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:19,533 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180115469]
[2025-03-03 10:52:19,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180115469] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:52:19,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23013146]
[2025-03-03 10:52:19,534 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:19,534 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:52:19,534 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:52:19,536 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)
[2025-03-03 10:52:19,537 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 10:52:19,604 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes.
[2025-03-03 10:52:19,689 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements.
[2025-03-03 10:52:19,689 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:19,689 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:19,692 INFO  L256         TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:52:19,703 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:52:19,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 447 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked.
[2025-03-03 10:52:19,771 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:52:19,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [23013146] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:19,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:52:19,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-03 10:52:19,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7307229]
[2025-03-03 10:52:19,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:19,772 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:19,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:19,773 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:19,773 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:52:19,773 INFO  L87              Difference]: Start difference. First operand 9376 states and 10122 transitions. Second operand  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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)
[2025-03-03 10:52:20,423 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:20,423 INFO  L93              Difference]: Finished difference Result 10873 states and 11675 transitions.
[2025-03-03 10:52:20,424 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:20,424 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 567
[2025-03-03 10:52:20,424 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:20,434 INFO  L225             Difference]: With dead ends: 10873
[2025-03-03 10:52:20,434 INFO  L226             Difference]: Without dead ends: 10871
[2025-03-03 10:52:20,437 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:52:20,437 INFO  L435           NwaCegarLoop]: 216 mSDtfsCounter, 287 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:20,437 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 257 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 10:52:20,445 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10871 states.
[2025-03-03 10:52:20,497 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10871 to 8775.
[2025-03-03 10:52:20,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8775 states, 8774 states have (on average 1.0832003647139274) internal successors, (9504), 8774 states have internal predecessors, (9504), 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)
[2025-03-03 10:52:20,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8775 states to 8775 states and 9504 transitions.
[2025-03-03 10:52:20,509 INFO  L78                 Accepts]: Start accepts. Automaton has 8775 states and 9504 transitions. Word has length 567
[2025-03-03 10:52:20,510 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:20,510 INFO  L471      AbstractCegarLoop]: Abstraction has 8775 states and 9504 transitions.
[2025-03-03 10:52:20,510 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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)
[2025-03-03 10:52:20,510 INFO  L276                IsEmpty]: Start isEmpty. Operand 8775 states and 9504 transitions.
[2025-03-03 10:52:20,513 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 594
[2025-03-03 10:52:20,513 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:20,514 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:20,520 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 10:52:20,714 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-03-03 10:52:20,715 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:20,715 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:20,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063440083, now seen corresponding path program 1 times
[2025-03-03 10:52:20,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:20,715 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278405633]
[2025-03-03 10:52:20,715 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:20,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:20,750 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes.
[2025-03-03 10:52:20,772 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements.
[2025-03-03 10:52:20,772 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:20,772 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:20,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 630 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked.
[2025-03-03 10:52:20,998 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:20,998 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278405633]
[2025-03-03 10:52:20,998 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278405633] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:20,998 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:20,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:20,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99004097]
[2025-03-03 10:52:20,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:20,999 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:20,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:21,000 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:21,000 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:21,000 INFO  L87              Difference]: Start difference. First operand 8775 states and 9504 transitions. Second operand  has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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)
[2025-03-03 10:52:21,862 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:21,862 INFO  L93              Difference]: Finished difference Result 21748 states and 23689 transitions.
[2025-03-03 10:52:21,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:21,862 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 593
[2025-03-03 10:52:21,863 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:21,874 INFO  L225             Difference]: With dead ends: 21748
[2025-03-03 10:52:21,874 INFO  L226             Difference]: Without dead ends: 13274
[2025-03-03 10:52:21,880 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:21,881 INFO  L435           NwaCegarLoop]: 522 mSDtfsCounter, 254 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:21,881 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 555 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:52:21,887 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13274 states.
[2025-03-03 10:52:21,952 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13274 to 12665.
[2025-03-03 10:52:21,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12665 states, 12664 states have (on average 1.07849020846494) internal successors, (13658), 12664 states have internal predecessors, (13658), 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)
[2025-03-03 10:52:21,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12665 states to 12665 states and 13658 transitions.
[2025-03-03 10:52:21,970 INFO  L78                 Accepts]: Start accepts. Automaton has 12665 states and 13658 transitions. Word has length 593
[2025-03-03 10:52:21,970 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:21,970 INFO  L471      AbstractCegarLoop]: Abstraction has 12665 states and 13658 transitions.
[2025-03-03 10:52:21,970 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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)
[2025-03-03 10:52:21,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 12665 states and 13658 transitions.
[2025-03-03 10:52:21,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 599
[2025-03-03 10:52:21,975 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:21,975 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:21,975 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 10:52:21,975 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:21,975 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:21,975 INFO  L85        PathProgramCache]: Analyzing trace with hash 1891839610, now seen corresponding path program 1 times
[2025-03-03 10:52:21,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:21,975 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135612633]
[2025-03-03 10:52:21,976 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:21,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:22,027 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes.
[2025-03-03 10:52:22,048 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements.
[2025-03-03 10:52:22,048 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:22,048 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:22,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 669 backedges. 72 proven. 311 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked.
[2025-03-03 10:52:22,644 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:22,644 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135612633]
[2025-03-03 10:52:22,644 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135612633] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:52:22,644 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118620495]
[2025-03-03 10:52:22,644 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:22,644 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:52:22,644 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:52:22,647 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)
[2025-03-03 10:52:22,648 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 10:52:22,705 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes.
[2025-03-03 10:52:22,775 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements.
[2025-03-03 10:52:22,775 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:22,775 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:22,777 INFO  L256         TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:52:22,781 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:52:22,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 669 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked.
[2025-03-03 10:52:22,912 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:52:22,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118620495] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:22,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:52:22,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-03 10:52:22,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401629512]
[2025-03-03 10:52:22,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:22,913 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:22,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:22,913 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:22,913 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:52:22,914 INFO  L87              Difference]: Start difference. First operand 12665 states and 13658 transitions. Second operand  has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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)
[2025-03-03 10:52:23,792 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:23,792 INFO  L93              Difference]: Finished difference Result 27719 states and 30128 transitions.
[2025-03-03 10:52:23,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:23,792 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 598
[2025-03-03 10:52:23,793 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:23,806 INFO  L225             Difference]: With dead ends: 27719
[2025-03-03 10:52:23,806 INFO  L226             Difference]: Without dead ends: 15355
[2025-03-03 10:52:23,815 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:52:23,815 INFO  L435           NwaCegarLoop]: 402 mSDtfsCounter, 302 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:23,815 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 422 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:52:23,824 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15355 states.
[2025-03-03 10:52:23,901 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15355 to 15056.
[2025-03-03 10:52:23,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15056 states, 15055 states have (on average 1.0838923945533046) internal successors, (16318), 15055 states have internal predecessors, (16318), 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)
[2025-03-03 10:52:23,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15056 states to 15056 states and 16318 transitions.
[2025-03-03 10:52:23,922 INFO  L78                 Accepts]: Start accepts. Automaton has 15056 states and 16318 transitions. Word has length 598
[2025-03-03 10:52:23,922 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:23,922 INFO  L471      AbstractCegarLoop]: Abstraction has 15056 states and 16318 transitions.
[2025-03-03 10:52:23,922 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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)
[2025-03-03 10:52:23,922 INFO  L276                IsEmpty]: Start isEmpty. Operand 15056 states and 16318 transitions.
[2025-03-03 10:52:23,926 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 624
[2025-03-03 10:52:23,926 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:23,927 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:52:23,933 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-03 10:52:24,127 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-03-03 10:52:24,127 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:24,128 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:24,128 INFO  L85        PathProgramCache]: Analyzing trace with hash 1313562331, now seen corresponding path program 1 times
[2025-03-03 10:52:24,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:24,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473580172]
[2025-03-03 10:52:24,128 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:24,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:24,198 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes.
[2025-03-03 10:52:24,227 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements.
[2025-03-03 10:52:24,227 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:24,227 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:24,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 503 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-03-03 10:52:24,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:24,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473580172]
[2025-03-03 10:52:24,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473580172] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:24,450 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:24,450 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:24,450 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703951312]
[2025-03-03 10:52:24,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:24,451 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:24,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:24,451 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:24,451 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:24,452 INFO  L87              Difference]: Start difference. First operand 15056 states and 16318 transitions. Second operand  has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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)
[2025-03-03 10:52:25,322 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:25,322 INFO  L93              Difference]: Finished difference Result 34594 states and 37532 transitions.
[2025-03-03 10:52:25,323 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:25,323 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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 623
[2025-03-03 10:52:25,323 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:25,339 INFO  L225             Difference]: With dead ends: 34594
[2025-03-03 10:52:25,339 INFO  L226             Difference]: Without dead ends: 17447
[2025-03-03 10:52:25,350 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:25,350 INFO  L435           NwaCegarLoop]: 505 mSDtfsCounter, 116 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:25,350 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 537 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:52:25,359 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17447 states.
[2025-03-03 10:52:25,445 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17447 to 14150.
[2025-03-03 10:52:25,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14150 states, 14149 states have (on average 1.0785921266520602) internal successors, (15261), 14149 states have internal predecessors, (15261), 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)
[2025-03-03 10:52:25,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 15261 transitions.
[2025-03-03 10:52:25,526 INFO  L78                 Accepts]: Start accepts. Automaton has 14150 states and 15261 transitions. Word has length 623
[2025-03-03 10:52:25,526 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:25,526 INFO  L471      AbstractCegarLoop]: Abstraction has 14150 states and 15261 transitions.
[2025-03-03 10:52:25,526 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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)
[2025-03-03 10:52:25,526 INFO  L276                IsEmpty]: Start isEmpty. Operand 14150 states and 15261 transitions.
[2025-03-03 10:52:25,531 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 636
[2025-03-03 10:52:25,531 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:25,531 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:52:25,531 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 10:52:25,531 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:25,532 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:25,532 INFO  L85        PathProgramCache]: Analyzing trace with hash 313643993, now seen corresponding path program 1 times
[2025-03-03 10:52:25,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:25,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487880405]
[2025-03-03 10:52:25,532 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:25,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:25,565 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 635 statements into 1 equivalence classes.
[2025-03-03 10:52:25,588 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 635 of 635 statements.
[2025-03-03 10:52:25,589 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:25,589 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:25,797 INFO  L134       CoverageAnalysis]: Checked inductivity of 655 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked.
[2025-03-03 10:52:25,798 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:25,798 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487880405]
[2025-03-03 10:52:25,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487880405] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:25,798 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:25,798 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:25,798 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066914192]
[2025-03-03 10:52:25,798 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:25,799 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:25,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:25,799 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:25,799 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:25,799 INFO  L87              Difference]: Start difference. First operand 14150 states and 15261 transitions. Second operand  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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)
[2025-03-03 10:52:26,616 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:26,616 INFO  L93              Difference]: Finished difference Result 32805 states and 35460 transitions.
[2025-03-03 10:52:26,617 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:26,617 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 635
[2025-03-03 10:52:26,617 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:26,633 INFO  L225             Difference]: With dead ends: 32805
[2025-03-03 10:52:26,633 INFO  L226             Difference]: Without dead ends: 18956
[2025-03-03 10:52:26,642 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:26,643 INFO  L435           NwaCegarLoop]: 488 mSDtfsCounter, 315 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:26,643 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 517 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 10:52:26,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18956 states.
[2025-03-03 10:52:26,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18956 to 18046.
[2025-03-03 10:52:26,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18046 states, 18045 states have (on average 1.0777500692712663) internal successors, (19448), 18045 states have internal predecessors, (19448), 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)
[2025-03-03 10:52:26,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18046 states to 18046 states and 19448 transitions.
[2025-03-03 10:52:26,797 INFO  L78                 Accepts]: Start accepts. Automaton has 18046 states and 19448 transitions. Word has length 635
[2025-03-03 10:52:26,797 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:26,797 INFO  L471      AbstractCegarLoop]: Abstraction has 18046 states and 19448 transitions.
[2025-03-03 10:52:26,797 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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)
[2025-03-03 10:52:26,797 INFO  L276                IsEmpty]: Start isEmpty. Operand 18046 states and 19448 transitions.
[2025-03-03 10:52:26,805 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 738
[2025-03-03 10:52:26,805 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:26,805 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:52:26,806 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 10:52:26,806 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:26,806 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:26,806 INFO  L85        PathProgramCache]: Analyzing trace with hash 1862943316, now seen corresponding path program 1 times
[2025-03-03 10:52:26,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:26,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689590944]
[2025-03-03 10:52:26,806 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:26,806 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:26,847 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 737 statements into 1 equivalence classes.
[2025-03-03 10:52:26,872 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 737 of 737 statements.
[2025-03-03 10:52:26,873 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:26,873 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:27,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 671 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked.
[2025-03-03 10:52:27,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:27,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689590944]
[2025-03-03 10:52:27,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689590944] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:27,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:27,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:27,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972989702]
[2025-03-03 10:52:27,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:27,128 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:27,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:27,129 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:27,129 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:27,129 INFO  L87              Difference]: Start difference. First operand 18046 states and 19448 transitions. Second operand  has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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)
[2025-03-03 10:52:28,045 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:28,045 INFO  L93              Difference]: Finished difference Result 40599 states and 43739 transitions.
[2025-03-03 10:52:28,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:28,046 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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 737
[2025-03-03 10:52:28,046 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:28,068 INFO  L225             Difference]: With dead ends: 40599
[2025-03-03 10:52:28,068 INFO  L226             Difference]: Without dead ends: 22854
[2025-03-03 10:52:28,081 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:28,082 INFO  L435           NwaCegarLoop]: 103 mSDtfsCounter, 188 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:28,082 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 126 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:52:28,094 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22854 states.
[2025-03-03 10:52:28,293 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22854 to 21037.
[2025-03-03 10:52:28,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21037 states, 21036 states have (on average 1.0743011979463777) internal successors, (22599), 21036 states have internal predecessors, (22599), 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)
[2025-03-03 10:52:28,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21037 states to 21037 states and 22599 transitions.
[2025-03-03 10:52:28,330 INFO  L78                 Accepts]: Start accepts. Automaton has 21037 states and 22599 transitions. Word has length 737
[2025-03-03 10:52:28,331 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:28,331 INFO  L471      AbstractCegarLoop]: Abstraction has 21037 states and 22599 transitions.
[2025-03-03 10:52:28,331 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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)
[2025-03-03 10:52:28,331 INFO  L276                IsEmpty]: Start isEmpty. Operand 21037 states and 22599 transitions.
[2025-03-03 10:52:28,341 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 786
[2025-03-03 10:52:28,341 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:28,341 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:52:28,341 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 10:52:28,341 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:28,341 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:28,342 INFO  L85        PathProgramCache]: Analyzing trace with hash -1812522443, now seen corresponding path program 1 times
[2025-03-03 10:52:28,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:28,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212143136]
[2025-03-03 10:52:28,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:28,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:28,384 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes.
[2025-03-03 10:52:28,410 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements.
[2025-03-03 10:52:28,410 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:28,410 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:29,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 1112 backedges. 705 proven. 195 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked.
[2025-03-03 10:52:29,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:29,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212143136]
[2025-03-03 10:52:29,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212143136] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:52:29,556 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597652814]
[2025-03-03 10:52:29,556 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:29,556 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:52:29,556 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:52:29,559 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)
[2025-03-03 10:52:29,561 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 10:52:29,639 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes.
[2025-03-03 10:52:29,748 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements.
[2025-03-03 10:52:29,748 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:29,748 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:29,751 INFO  L256         TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 10:52:29,756 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:52:32,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 1112 backedges. 900 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked.
[2025-03-03 10:52:32,751 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:52:32,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [597652814] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:32,751 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:52:32,751 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 10:52:32,751 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780858716]
[2025-03-03 10:52:32,751 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:32,752 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:52:32,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:32,752 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:52:32,752 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:52:32,754 INFO  L87              Difference]: Start difference. First operand 21037 states and 22599 transitions. Second operand  has 4 states, 4 states have (on average 149.75) internal successors, (599), 3 states have internal predecessors, (599), 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)
[2025-03-03 10:52:34,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:34,298 INFO  L93              Difference]: Finished difference Result 50169 states and 53759 transitions.
[2025-03-03 10:52:34,298 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:52:34,299 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 149.75) internal successors, (599), 3 states have internal predecessors, (599), 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 785
[2025-03-03 10:52:34,299 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:34,325 INFO  L225             Difference]: With dead ends: 50169
[2025-03-03 10:52:34,325 INFO  L226             Difference]: Without dead ends: 29134
[2025-03-03 10:52:34,338 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:52:34,339 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 308 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:34,339 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 110 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 10:52:34,355 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29134 states.
[2025-03-03 10:52:34,529 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29134 to 28532.
[2025-03-03 10:52:34,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28532 states, 28531 states have (on average 1.0648768006729523) internal successors, (30382), 28531 states have internal predecessors, (30382), 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)
[2025-03-03 10:52:34,640 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28532 states to 28532 states and 30382 transitions.
[2025-03-03 10:52:34,641 INFO  L78                 Accepts]: Start accepts. Automaton has 28532 states and 30382 transitions. Word has length 785
[2025-03-03 10:52:34,641 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:34,641 INFO  L471      AbstractCegarLoop]: Abstraction has 28532 states and 30382 transitions.
[2025-03-03 10:52:34,641 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 149.75) internal successors, (599), 3 states have internal predecessors, (599), 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)
[2025-03-03 10:52:34,641 INFO  L276                IsEmpty]: Start isEmpty. Operand 28532 states and 30382 transitions.
[2025-03-03 10:52:34,653 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 787
[2025-03-03 10:52:34,653 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:34,653 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:34,660 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-03 10:52:34,853 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:52:34,854 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:34,854 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:34,854 INFO  L85        PathProgramCache]: Analyzing trace with hash -1830286616, now seen corresponding path program 1 times
[2025-03-03 10:52:34,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:34,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890101673]
[2025-03-03 10:52:34,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:34,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:34,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 786 statements into 1 equivalence classes.
[2025-03-03 10:52:34,920 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 786 of 786 statements.
[2025-03-03 10:52:34,920 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:34,920 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:35,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 1180 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked.
[2025-03-03 10:52:35,147 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:35,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890101673]
[2025-03-03 10:52:35,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890101673] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:35,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:35,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:35,147 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840828866]
[2025-03-03 10:52:35,147 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:35,147 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:35,148 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:35,148 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:35,148 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:35,148 INFO  L87              Difference]: Start difference. First operand 28532 states and 30382 transitions. Second operand  has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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)
[2025-03-03 10:52:36,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:36,034 INFO  L93              Difference]: Finished difference Result 61245 states and 65271 transitions.
[2025-03-03 10:52:36,034 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:36,035 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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 786
[2025-03-03 10:52:36,035 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:36,066 INFO  L225             Difference]: With dead ends: 61245
[2025-03-03 10:52:36,066 INFO  L226             Difference]: Without dead ends: 33014
[2025-03-03 10:52:36,081 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:36,081 INFO  L435           NwaCegarLoop]: 136 mSDtfsCounter, 168 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:36,082 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 169 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 10:52:36,100 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33014 states.
[2025-03-03 10:52:36,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33014 to 30323.
[2025-03-03 10:52:36,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30323 states, 30322 states have (on average 1.0608469098344437) internal successors, (32167), 30322 states have internal predecessors, (32167), 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)
[2025-03-03 10:52:36,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30323 states to 30323 states and 32167 transitions.
[2025-03-03 10:52:36,376 INFO  L78                 Accepts]: Start accepts. Automaton has 30323 states and 32167 transitions. Word has length 786
[2025-03-03 10:52:36,376 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:36,376 INFO  L471      AbstractCegarLoop]: Abstraction has 30323 states and 32167 transitions.
[2025-03-03 10:52:36,376 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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)
[2025-03-03 10:52:36,376 INFO  L276                IsEmpty]: Start isEmpty. Operand 30323 states and 32167 transitions.
[2025-03-03 10:52:36,388 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 794
[2025-03-03 10:52:36,388 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:36,388 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:36,388 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-03 10:52:36,388 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:36,389 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:36,389 INFO  L85        PathProgramCache]: Analyzing trace with hash -1941416366, now seen corresponding path program 1 times
[2025-03-03 10:52:36,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:36,389 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276540706]
[2025-03-03 10:52:36,389 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:36,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:36,430 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 793 statements into 1 equivalence classes.
[2025-03-03 10:52:36,457 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 793 of 793 statements.
[2025-03-03 10:52:36,457 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:36,457 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:37,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 1185 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked.
[2025-03-03 10:52:37,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:37,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276540706]
[2025-03-03 10:52:37,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276540706] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:37,129 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:37,129 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:52:37,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908746992]
[2025-03-03 10:52:37,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:37,129 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:52:37,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:37,130 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:52:37,130 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:52:37,130 INFO  L87              Difference]: Start difference. First operand 30323 states and 32167 transitions. Second operand  has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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)
[2025-03-03 10:52:38,396 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:38,396 INFO  L93              Difference]: Finished difference Result 67235 states and 71359 transitions.
[2025-03-03 10:52:38,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:52:38,397 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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 793
[2025-03-03 10:52:38,397 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:38,428 INFO  L225             Difference]: With dead ends: 67235
[2025-03-03 10:52:38,428 INFO  L226             Difference]: Without dead ends: 32728
[2025-03-03 10:52:38,449 INFO  L434           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
[2025-03-03 10:52:38,449 INFO  L435           NwaCegarLoop]: 393 mSDtfsCounter, 513 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:38,449 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 441 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 10:52:38,467 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32728 states.
[2025-03-03 10:52:38,641 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32728 to 25833.
[2025-03-03 10:52:38,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25833 states, 25832 states have (on average 1.0455249303189842) internal successors, (27008), 25832 states have internal predecessors, (27008), 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)
[2025-03-03 10:52:38,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25833 states to 25833 states and 27008 transitions.
[2025-03-03 10:52:38,778 INFO  L78                 Accepts]: Start accepts. Automaton has 25833 states and 27008 transitions. Word has length 793
[2025-03-03 10:52:38,778 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:38,778 INFO  L471      AbstractCegarLoop]: Abstraction has 25833 states and 27008 transitions.
[2025-03-03 10:52:38,778 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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)
[2025-03-03 10:52:38,778 INFO  L276                IsEmpty]: Start isEmpty. Operand 25833 states and 27008 transitions.
[2025-03-03 10:52:38,788 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 819
[2025-03-03 10:52:38,788 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:38,788 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:38,788 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-03 10:52:38,789 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:38,789 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:38,789 INFO  L85        PathProgramCache]: Analyzing trace with hash 837100430, now seen corresponding path program 1 times
[2025-03-03 10:52:38,789 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:38,789 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547655810]
[2025-03-03 10:52:38,789 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:38,789 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:38,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 818 statements into 1 equivalence classes.
[2025-03-03 10:52:38,857 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 818 of 818 statements.
[2025-03-03 10:52:38,858 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:38,858 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:52:39,152 INFO  L134       CoverageAnalysis]: Checked inductivity of 1212 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked.
[2025-03-03 10:52:39,153 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:52:39,153 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547655810]
[2025-03-03 10:52:39,153 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547655810] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:52:39,153 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:52:39,153 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:52:39,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054977203]
[2025-03-03 10:52:39,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:52:39,153 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:52:39,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:52:39,154 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:52:39,154 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:39,154 INFO  L87              Difference]: Start difference. First operand 25833 states and 27008 transitions. Second operand  has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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)
[2025-03-03 10:52:39,813 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:52:39,813 INFO  L93              Difference]: Finished difference Result 51359 states and 53699 transitions.
[2025-03-03 10:52:39,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:52:39,813 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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 818
[2025-03-03 10:52:39,814 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:52:39,834 INFO  L225             Difference]: With dead ends: 51359
[2025-03-03 10:52:39,834 INFO  L226             Difference]: Without dead ends: 25528
[2025-03-03 10:52:39,849 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:52:39,850 INFO  L435           NwaCegarLoop]: 465 mSDtfsCounter, 106 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:52:39,850 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 502 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 10:52:39,867 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25528 states.
[2025-03-03 10:52:40,002 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25528 to 23430.
[2025-03-03 10:52:40,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23430 states, 23429 states have (on average 1.0265909769943233) internal successors, (24052), 23429 states have internal predecessors, (24052), 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)
[2025-03-03 10:52:40,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23430 states to 23430 states and 24052 transitions.
[2025-03-03 10:52:40,038 INFO  L78                 Accepts]: Start accepts. Automaton has 23430 states and 24052 transitions. Word has length 818
[2025-03-03 10:52:40,039 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:52:40,039 INFO  L471      AbstractCegarLoop]: Abstraction has 23430 states and 24052 transitions.
[2025-03-03 10:52:40,039 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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)
[2025-03-03 10:52:40,039 INFO  L276                IsEmpty]: Start isEmpty. Operand 23430 states and 24052 transitions.
[2025-03-03 10:52:40,048 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 823
[2025-03-03 10:52:40,048 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:52:40,048 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:52:40,048 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-03 10:52:40,048 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:52:40,049 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:52:40,049 INFO  L85        PathProgramCache]: Analyzing trace with hash -1645538833, now seen corresponding path program 1 times
[2025-03-03 10:52:40,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:52:40,049 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354440598]
[2025-03-03 10:52:40,049 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:52:40,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:52:40,094 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes.
[2025-03-03 10:52:40,168 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements.
[2025-03-03 10:52:40,169 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:40,169 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 10:52:40,169 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-03 10:52:40,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes.
[2025-03-03 10:52:40,236 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements.
[2025-03-03 10:52:40,236 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:52:40,236 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 10:52:40,465 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-03 10:52:40,466 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-03 10:52:40,467 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 10:52:40,469 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-03 10:52:40,471 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:52:40,638 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 10:52:40,640 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:52:40 BoogieIcfgContainer
[2025-03-03 10:52:40,640 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 10:52:40,640 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 10:52:40,640 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 10:52:40,640 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 10:52:40,643 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:51:53" (3/4) ...
[2025-03-03 10:52:40,643 INFO  L140         WitnessPrinter]: Generating witness for reachability counterexample
[2025-03-03 10:52:40,834 INFO  L127   tionWitnessGenerator]: Generated YAML witness of length 825.
[2025-03-03 10:52:41,006 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-03 10:52:41,008 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-03 10:52:41,009 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 10:52:41,009 INFO  L158              Benchmark]: Toolchain (without parser) took 50461.23ms. Allocated memory was 142.6MB in the beginning and 922.7MB in the end (delta: 780.1MB). Free memory was 100.9MB in the beginning and 308.6MB in the end (delta: -207.6MB). Peak memory consumption was 564.4MB. Max. memory is 16.1GB.
[2025-03-03 10:52:41,009 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 10:52:41,010 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 578.49ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 88.8MB in the end (delta: 12.2MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB.
[2025-03-03 10:52:41,010 INFO  L158              Benchmark]: Boogie Procedure Inliner took 156.20ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 51.5MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2025-03-03 10:52:41,010 INFO  L158              Benchmark]: Boogie Preprocessor took 215.72ms. Allocated memory is still 142.6MB. Free memory was 51.5MB in the beginning and 46.1MB in the end (delta: 5.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB.
[2025-03-03 10:52:41,010 INFO  L158              Benchmark]: IcfgBuilder took 2091.79ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 46.1MB in the beginning and 245.0MB in the end (delta: -198.9MB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB.
[2025-03-03 10:52:41,011 INFO  L158              Benchmark]: TraceAbstraction took 47041.08ms. Allocated memory was 377.5MB in the beginning and 922.7MB in the end (delta: 545.3MB). Free memory was 245.0MB in the beginning and 400.8MB in the end (delta: -155.8MB). Peak memory consumption was 384.8MB. Max. memory is 16.1GB.
[2025-03-03 10:52:41,011 INFO  L158              Benchmark]: Witness Printer took 368.49ms. Allocated memory is still 922.7MB. Free memory was 400.8MB in the beginning and 308.6MB in the end (delta: 92.3MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB.
[2025-03-03 10:52:41,011 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 578.49ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 88.8MB in the end (delta: 12.2MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 156.20ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 51.5MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 215.72ms. Allocated memory is still 142.6MB. Free memory was 51.5MB in the beginning and 46.1MB in the end (delta: 5.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2091.79ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 46.1MB in the beginning and 245.0MB in the end (delta: -198.9MB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 47041.08ms. Allocated memory was 377.5MB in the beginning and 922.7MB in the end (delta: 545.3MB). Free memory was 245.0MB in the beginning and 400.8MB in the end (delta: -155.8MB). Peak memory consumption was 384.8MB. Max. memory is 16.1GB.
 * Witness Printer took 368.49ms. Allocated memory is still 922.7MB. Free memory was 400.8MB in the beginning and 308.6MB in the end (delta: 92.3MB). Peak memory consumption was 92.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: 95]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L18]                int inputD = 4;
[L19]                int inputB = 2;
[L20]                int inputE = 5;
[L21]                int inputA = 1;
[L22]                int inputF = 6;
[L23]                int inputC = 3;
[L26]                int a4 = -89;
[L27]                int a29 = -127;
[L28]                int a2 = 1;
[L29]                int a0 = -44;
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1773]              int output = -1;
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1776]  COND TRUE   1
[L1779]              int input;
[L1780]              input = __VERIFIER_nondet_int()
[L1781]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L1784]  CALL, EXPR  calculate_output(input)
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  -61 < a0 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L214]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L218]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 1) && (((a2==3) &&  a29 <=  -144 ) || (((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L224]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L229]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==2) && ( a29 <=  -144  && (input == 3))) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L239]   COND FALSE  !((( a0 <=  -147  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L244]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L251]   COND FALSE  !(((((a2==3) && ((input == 3) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&  -61 < a0 ) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L257]   COND FALSE  !(((((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L263]   COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 ))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270]   COND FALSE  !((( -61 < a0  && ((((a2==3) &&  a29 <=  -144 ) || ((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ( 43 < a29  && (a2==2)))) && (input == 2))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L276]   COND FALSE  !(((((a2==4) && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L283]   COND FALSE  !((((((input == 4) &&  43 < a29 ) && (a2==1)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L288]   COND FALSE  !((( -61 < a0  && (((( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 1))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L295]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L302]   COND FALSE  !((((a2==2) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L309]   COND FALSE  !((((((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316]   COND FALSE  !(((a2==4) && ( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330]   COND FALSE  !((((((input == 3) &&  -61 < a0 ) &&  a4 <=  -86 ) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L337]   COND FALSE  !(((a2==1) && ( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L343]   COND FALSE  !((( -61 < a0  && ( 43 < a29  && ((input == 4) && (a2==5)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L346]   COND FALSE  !(((((((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4)))) && (input == 5)) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L351]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L360]   COND FALSE  !(( 43 < a29  && (( -61 < a0  && ( a4 <=  -86  && (input == 1))) && (a2==5))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L365]   COND FALSE  !((( a4 <=  -86  && ( 43 < a29  && ((input == 2) &&  -61 < a0 ))) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L371]   COND FALSE  !(((((input == 6) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L377]   COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 3)) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L383]   COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L390]   COND FALSE  !(((( a4 <=  -86  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L394]   COND FALSE  !(( -61 < a0  && ((( 43 < a29  && (input == 6)) && (a2==5)) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L400]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==5)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L425]   COND FALSE  !(((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 ) && (input == 6)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L432]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==3) && (((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L438]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 5) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 )) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L443]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==3) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L449]   COND FALSE  !(((((a2==3) && ((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L455]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L459]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==4)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L466]   COND FALSE  !(((((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 2)) &&  a4 <=  -86 ) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L472]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((  ((-98 < a0) && (-61 >= a0))  && (input == 6)) && (a2==2))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L478]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ( a4 <=  -86  && (((input == 6) &&  -61 < a0 ) && (a2==5)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L484]   COND FALSE  !(((  ((-16 < a29) && (43 >= a29))  && (((input == 4) &&  -61 < a0 ) &&  a4 <=  -86 )) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L489]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ((a2==2) &&  43 < a29 )) || ( a29 <=  -144  && (a2==3)))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L496]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((input == 1) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==2)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L501]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 6) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) && (a2==2)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L507]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((input == 3) && (((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 ))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L512]   COND FALSE  !(((( a0 <=  -147  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L517]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L524]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ( a29 <=  -144  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 3) && (a2==5))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L530]   COND FALSE  !(((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && (((input == 5) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L539]   COND FALSE  !((((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L552]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && ( a0 <=  -147  && (  ((-16 < a29) && (43 >= a29))  && (input == 5))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L556]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2)))) && (input == 4)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L567]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==2) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2)) &&   ((-98 < a0) && (-61 >= a0)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L579]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==5) && ( 43 < a29  && (input == 3))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L584]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((a2==3) && (input == 4)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L597]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 )) || ((a2==2) &&  a29 <=  -144 )) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L604]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L616]   COND FALSE  !((((a2==2) && ((  ((-144 < a29) && (-16 >= a29))  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L623]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 6) && (((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L630]   COND FALSE  !(((((a2==1) && ((input == 5) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L637]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )))) && (a2==2)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L644]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (( a0 <=  -147  && (input == 2)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L651]   COND FALSE  !(((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L662]   COND FALSE  !(((((a2==1) && ((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L667]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==1) && ((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L672]   COND FALSE  !(( a0 <=  -147  && ((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 2))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L678]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 )) || ((a2==3) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L685]   COND FALSE  !(((((a2==5) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L691]   COND FALSE  !(((a2==2) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L697]   COND FALSE  !(((( a4 <=  -86  && ( -61 < a0  && (input == 5))) && (a2==5)) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L703]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L717]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L722]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) &&   ((-98 < a0) && (-61 >= a0)) )) &&  a29 <=  -144 ) && (a2==2)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L728]   COND FALSE  !(((a2==1) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L735]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((((a2==4) &&  43 < a29 ) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 3)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L742]   COND FALSE  !((((a2==5) && (((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L745]   COND FALSE  !((((  ((-16 < a29) && (43 >= a29))  && ((input == 1) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L752]   COND FALSE  !((( a4 <=  -86  && ((input == 6) && ((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ((a2==2) &&  43 < a29 )) || ((a2==3) &&  a29 <=  -144 )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L758]   COND FALSE  !(((( -61 < a0  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 5))) &&  a4 <=  -86 ) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L764]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 ))) && (input == 5)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L771]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 6) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) &&  43 < a29 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L778]   COND FALSE  !(( a0 <=  -147  && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L784]   COND FALSE  !(((((a2==1) && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L789]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && ((a2==4) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L796]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L803]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  && (a2==2)) || ((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 ))) && (input == 4))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L814]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L821]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==2))) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L827]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==3) && (  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L834]   COND FALSE  !(((a2==5) && ((( a0 <=  -147  && (input == 5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L839]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && (input == 3))) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L850]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==4) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L855]   COND FALSE  !((( a4 <=  -86  && ((input == 3) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L861]   COND FALSE  !(((a2==4) && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L865]   COND FALSE  !(((a2==5) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L872]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) &&  43 < a29 ) || ( a29 <=  -144  && (a2==3)))) && (input == 1))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L878]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) &&  a0 <=  -147 ) && (a2==5))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L884]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && ((input == 5) && ((( 43 < a29  && (a2==4)) || ( a29 <=  -144  && (a2==5))) || ((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L890]   COND FALSE  !(((a2==3) && ( a4 <=  -86  && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  -61 < a0 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L895]   COND FALSE  !(((a2==5) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L905]   COND FALSE  !((((( -61 < a0  && (input == 2)) &&  43 < a29 ) &&  a4 <=  -86 ) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L911]   COND FALSE  !((((((input == 1) && (a2==1)) &&  43 < a29 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L917]   COND FALSE  !(((((a2==2) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L922]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 6) &&  43 < a29 ) && (a2==2))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L929]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==3))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L935]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 1) && (a2==5)) &&   ((-86 < a4) && (-42 >= a4)) )) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L940]   COND FALSE  !((((a2==1) && ( a0 <=  -147  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L945]   COND FALSE  !(((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==4)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L952]   COND FALSE  !((((a2==1) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L958]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((input == 5) && (a2==2)))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L965]   COND FALSE  !((( -61 < a0  && ((a2==1) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L969]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((((a2==1) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 )) && (input == 5)) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L976]   COND FALSE  !(((((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L983]   COND FALSE  !(( a4 <=  -86  && ((( 43 < a29  && (input == 5)) &&  -61 < a0 ) && (a2==3))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L989]   COND FALSE  !((((a2==4) && ( a4 <=  -86  && ((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L995]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1002]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1008]  COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1014]  COND FALSE  !((((((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1021]  COND FALSE  !((((  ((-98 < a0) && (-61 >= a0))  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1026]  COND FALSE  !((((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1029]  COND FALSE  !((((a2==2) && ((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1036]  COND FALSE  !(((a2==5) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&  a29 <=  -144 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1040]  COND FALSE  !(( a4 <=  -86  && ((((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))) || ((a2==3) &&  a29 <=  -144 )) && (input == 3)) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1045]  COND FALSE  !(((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 1)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1048]  COND FALSE  !(( a0 <=  -147  && ((((((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4))) || ((a2==4) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1054]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (( a0 <=  -147  && ((a2==5) && (input == 1))) &&  43 < a29 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1059]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) )) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1072]  COND FALSE  !((((a2==2) && (((input == 4) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1084]  COND FALSE  !(((((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 )) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1091]  COND FALSE  !(( a4 <=  -86  && (((input == 6) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1096]  COND FALSE  !(((a2==1) && (( 43 < a29  && ((input == 2) &&   ((-98 < a0) && (-61 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1101]  COND FALSE  !((((((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&  a4 <=  -86 ) && (a2==3)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1108]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1118]  COND FALSE  !(((a2==2) && ((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1125]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1132]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && (((input == 2) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) && (a2==5)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1138]  COND FALSE  !(( 43 < a29  && ( a4 <=  -86  && ( -61 < a0  && ((a2==3) && (input == 3))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1144]  COND FALSE  !((((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1155]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 ))) && (input == 1)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1160]  COND FALSE  !(((a2==4) && ((((input == 3) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1166]  COND FALSE  !(((a2==4) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  a4 <=  -86 ) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1172]  COND FALSE  !((((a2==4) && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4)) &&   ((-98 < a0) && (-61 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1178]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ( 43 < a29  && ((input == 3) && (a2==1)))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1182]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1188]  COND FALSE  !(( a0 <=  -147  && (((((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2)))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1194]  COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 2) && (a2==2))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1200]  COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 2)) &&  a29 <=  -144 ) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1207]  COND FALSE  !((((a2==5) && ( -61 < a0  && ((input == 5) &&  43 < a29 ))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1213]  COND FALSE  !((((( a0 <=  -147  && (input == 6)) && (a2==5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1218]  COND FALSE  !(( 43 < a29  && ((((input == 4) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1222]  COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((a2==1) && ((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1228]  COND FALSE  !(( -61 < a0  && (((input == 1) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2)))) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1234]  COND FALSE  !((((  ((-98 < a0) && (-61 >= a0))  && ((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1241]  COND FALSE  !(((a2==3) && ((  ((-98 < a0) && (-61 >= a0))  && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1247]  COND FALSE  !(( -61 < a0  && ((((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2))) && (input == 2)) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1253]  COND FALSE  !(((((input == 1) && (( a29 <=  -144  && (a2==2)) || ((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1259]  COND FALSE  !(((( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && (input == 3))) && (a2==5)) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1265]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 5)) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1271]  COND FALSE  !(((a2==2) && ((((input == 3) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1274]  COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && (input == 2))) && (a2==5)) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1281]  COND FALSE  !((( -61 < a0  && ((input == 5) && ((((a2==1) &&  43 < a29 ) || ((a2==2) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2))))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1287]  COND FALSE  !(((a2==1) && ((((input == 1) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1293]  COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((a2==2) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1299]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ( 43 < a29  && (((a2==2) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1310]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1316]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((  ((-86 < a4) && (-42 >= a4))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4))) && (a2==3))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1323]  COND FALSE  !(((a2==1) && ((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 6)) &&  a4 <=  -86 ) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1327]  COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((input == 5) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) && (a2==1)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1331]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((input == 5) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1343]  COND FALSE  !((( a0 <=  -147  && (((input == 1) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1348]  COND FALSE  !((( -61 < a0  && ((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 6))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1354]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((a2==5) && (((input == 4) && ( 43 < a29  || (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1360]  COND FALSE  !((( a0 <=  -147  && (((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1369]  COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 6)) &&  a4 <=  -86 ) && (a2==3)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1375]  COND FALSE  !((((((input == 6) &&  a29 <=  -144 ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1381]  COND FALSE  !((((((input == 4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1388]  COND FALSE  !(( -61 < a0  && (((a2==3) && ( a4 <=  -86  && (input == 1))) &&  43 < a29 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1395]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 6) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) && (a2==5))) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1398]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((a2==4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4)))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1404]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) &&   ((-98 < a0) && (-61 >= a0)) )) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1418]  COND FALSE  !(( a4 <=  -86  && ((((((a2==1) &&  43 < a29 ) || ((a2==2) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2))) && (input == 4)) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1423]  COND FALSE  !((((a2==3) && (((input == 5) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1429]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && (((a2==3) && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1441]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==2) && (  ((-144 < a29) && (-16 >= a29))  && (input == 5))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1448]  COND FALSE  !(((((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) &&  43 < a29 ) || ((a2==3) &&  a29 <=  -144 ))) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1459]  COND FALSE  !(((a2==3) && (  ((-147 < a0) && (-98 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1466]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 1)) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1471]  COND FALSE  !(((a2==2) && ((  ((-98 < a0) && (-61 >= a0))  && ((input == 5) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1476]  COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 5))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1483]  COND FALSE  !(((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==4)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1488]  COND FALSE  !((((((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1492]  COND FALSE  !((( a0 <=  -147  && ((input == 3) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1498]  COND FALSE  !(( -61 < a0  && (((input == 4) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==5)) || (((a2==4) &&  43 < a29 ) || ((a2==5) &&  a29 <=  -144 )))) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1504]  COND FALSE  !(((a2==4) && (  ((-147 < a0) && (-98 >= a0))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1511]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && (a2==4)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1518]  COND FALSE  !(((((  ((-86 < a4) && (-42 >= a4))  && (input == 5)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==2)) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1521]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==2) && (( 43 < a29  && (input == 1)) &&   ((-98 < a0) && (-61 >= a0)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1526]  COND FALSE  !(((a2==5) && (  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1532]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 1))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1538]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (((a2==1) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 1))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1543]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((((a2==2) &&  43 < a29 ) || ((a2==3) &&  a29 <=  -144 )) || ((a2==3) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 3)) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1550]  COND FALSE  !(( a0 <=  -147  && ((((a2==1) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-16 < a29) && (43 >= a29)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1557]  COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==2) && ((input == 2) &&   ((-86 < a4) && (-42 >= a4)) )))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1564]  COND TRUE   (((a2==1) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2)) &&  a4 <=  -86 )) &&  -61 < a0 )
[L1565]              a29 = ((((a29 - -384948) * -1)/ 10) * 5)
[L1566]              a2 = 2
[L1568]              return 21;
         VAL         [\result=21, a0=-44, a29=-192410, a2=2, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1784]  RET, EXPR   calculate_output(input)
[L1784]              output = calculate_output(input)
[L1776]  COND TRUE   1
[L1779]              int input;
[L1780]              input = __VERIFIER_nondet_int()
[L1781]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L1784]  CALL, EXPR  calculate_output(input)
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  -61 < a0 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L214]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L218]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 1) && (((a2==3) &&  a29 <=  -144 ) || (((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L224]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L229]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==2) && ( a29 <=  -144  && (input == 3))) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L239]   COND FALSE  !((( a0 <=  -147  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L244]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L251]   COND FALSE  !(((((a2==3) && ((input == 3) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&  -61 < a0 ) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L257]   COND FALSE  !(((((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L263]   COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 ))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270]   COND FALSE  !((( -61 < a0  && ((((a2==3) &&  a29 <=  -144 ) || ((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ( 43 < a29  && (a2==2)))) && (input == 2))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L276]   COND FALSE  !(((((a2==4) && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L283]   COND FALSE  !((((((input == 4) &&  43 < a29 ) && (a2==1)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L288]   COND FALSE  !((( -61 < a0  && (((( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 1))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L295]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==3)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L302]   COND FALSE  !((((a2==2) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L309]   COND FALSE  !((((((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316]   COND FALSE  !(((a2==4) && ( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330]   COND FALSE  !((((((input == 3) &&  -61 < a0 ) &&  a4 <=  -86 ) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==5)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L337]   COND FALSE  !(((a2==1) && ( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L343]   COND FALSE  !((( -61 < a0  && ( 43 < a29  && ((input == 4) && (a2==5)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L346]   COND FALSE  !(((((((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4)))) && (input == 5)) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L351]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L360]   COND FALSE  !(( 43 < a29  && (( -61 < a0  && ( a4 <=  -86  && (input == 1))) && (a2==5))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L365]   COND FALSE  !((( a4 <=  -86  && ( 43 < a29  && ((input == 2) &&  -61 < a0 ))) && (a2==3)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L371]   COND FALSE  !(((((input == 6) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L377]   COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 3)) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L383]   COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L390]   COND FALSE  !(((( a4 <=  -86  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L394]   COND FALSE  !(( -61 < a0  && ((( 43 < a29  && (input == 6)) && (a2==5)) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L400]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==5)))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4)))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L425]   COND FALSE  !(((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 ) && (input == 6)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L432]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==3) && (((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L438]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 5) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 )) && (a2==5)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L443]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==3) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L449]   COND FALSE  !(((((a2==3) && ((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L455]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L459]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==4)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L466]   COND FALSE  !(((((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 2)) &&  a4 <=  -86 ) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L472]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((  ((-98 < a0) && (-61 >= a0))  && (input == 6)) && (a2==2))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L478]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ( a4 <=  -86  && (((input == 6) &&  -61 < a0 ) && (a2==5)))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L484]   COND FALSE  !(((  ((-16 < a29) && (43 >= a29))  && (((input == 4) &&  -61 < a0 ) &&  a4 <=  -86 )) && (a2==5)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L489]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ((a2==2) &&  43 < a29 )) || ( a29 <=  -144  && (a2==3)))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L496]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((input == 1) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==2)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L501]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 6) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) && (a2==2)))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L507]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((input == 3) && (((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 ))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L512]   COND FALSE  !(((( a0 <=  -147  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L517]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L524]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ( a29 <=  -144  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 3) && (a2==5))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L530]   COND FALSE  !(((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && (((input == 5) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L539]   COND FALSE  !((((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L552]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && ( a0 <=  -147  && (  ((-16 < a29) && (43 >= a29))  && (input == 5))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L556]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2)))) && (input == 4)))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L567]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==2) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2)) &&   ((-98 < a0) && (-61 >= a0)) ))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L579]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==5) && ( 43 < a29  && (input == 3))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L584]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((a2==3) && (input == 4)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L597]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 )) || ((a2==2) &&  a29 <=  -144 )) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L604]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L616]   COND FALSE  !((((a2==2) && ((  ((-144 < a29) && (-16 >= a29))  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L623]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 6) && (((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L630]   COND FALSE  !(((((a2==1) && ((input == 5) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L637]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )))) && (a2==2)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L644]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (( a0 <=  -147  && (input == 2)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L651]   COND FALSE  !(((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L662]   COND FALSE  !(((((a2==1) && ((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L667]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==1) && ((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L672]   COND FALSE  !(( a0 <=  -147  && ((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 2))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L678]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 )) || ((a2==3) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L685]   COND FALSE  !(((((a2==5) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L691]   COND FALSE  !(((a2==2) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L697]   COND FALSE  !(((( a4 <=  -86  && ( -61 < a0  && (input == 5))) && (a2==5)) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L703]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L717]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L722]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) &&   ((-98 < a0) && (-61 >= a0)) )) &&  a29 <=  -144 ) && (a2==2)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L728]   COND FALSE  !(((a2==1) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L735]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((((a2==4) &&  43 < a29 ) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 3)))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L742]   COND FALSE  !((((a2==5) && (((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L745]   COND FALSE  !((((  ((-16 < a29) && (43 >= a29))  && ((input == 1) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L752]   COND FALSE  !((( a4 <=  -86  && ((input == 6) && ((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ((a2==2) &&  43 < a29 )) || ((a2==3) &&  a29 <=  -144 )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L758]   COND FALSE  !(((( -61 < a0  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 5))) &&  a4 <=  -86 ) && (a2==3)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L764]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 ))) && (input == 5)))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L771]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 6) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) &&  43 < a29 )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L778]   COND FALSE  !(( a0 <=  -147  && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L784]   COND FALSE  !(((((a2==1) && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L789]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && ((a2==4) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L796]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L803]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  && (a2==2)) || ((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 ))) && (input == 4))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L814]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L821]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==2))) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L827]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==3) && (  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L834]   COND FALSE  !(((a2==5) && ((( a0 <=  -147  && (input == 5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L839]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && (input == 3))) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L850]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==4) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L855]   COND FALSE  !((( a4 <=  -86  && ((input == 3) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L861]   COND FALSE  !(((a2==4) && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L865]   COND FALSE  !(((a2==5) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L872]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) &&  43 < a29 ) || ( a29 <=  -144  && (a2==3)))) && (input == 1))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L878]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) &&  a0 <=  -147 ) && (a2==5))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L884]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && ((input == 5) && ((( 43 < a29  && (a2==4)) || ( a29 <=  -144  && (a2==5))) || ((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L890]   COND FALSE  !(((a2==3) && ( a4 <=  -86  && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  -61 < a0 ))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L895]   COND FALSE  !(((a2==5) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L905]   COND FALSE  !((((( -61 < a0  && (input == 2)) &&  43 < a29 ) &&  a4 <=  -86 ) && (a2==5)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L911]   COND FALSE  !((((((input == 1) && (a2==1)) &&  43 < a29 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L917]   COND FALSE  !(((((a2==2) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L922]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 6) &&  43 < a29 ) && (a2==2))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L929]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==3))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L935]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 1) && (a2==5)) &&   ((-86 < a4) && (-42 >= a4)) )) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L940]   COND FALSE  !((((a2==1) && ( a0 <=  -147  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L945]   COND FALSE  !(((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==4)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L952]   COND FALSE  !((((a2==1) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L958]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((input == 5) && (a2==2)))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L965]   COND FALSE  !((( -61 < a0  && ((a2==1) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L969]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((((a2==1) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 )) && (input == 5)) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L976]   COND FALSE  !(((((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L983]   COND FALSE  !(( a4 <=  -86  && ((( 43 < a29  && (input == 5)) &&  -61 < a0 ) && (a2==3))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L989]   COND FALSE  !((((a2==4) && ( a4 <=  -86  && ((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L995]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1002]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1008]  COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4)))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1014]  COND FALSE  !((((((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1021]  COND FALSE  !((((  ((-98 < a0) && (-61 >= a0))  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1026]  COND FALSE  !((((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1029]  COND FALSE  !((((a2==2) && ((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1036]  COND FALSE  !(((a2==5) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&  a29 <=  -144 ))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1040]  COND FALSE  !(( a4 <=  -86  && ((((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))) || ((a2==3) &&  a29 <=  -144 )) && (input == 3)) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1045]  COND FALSE  !(((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 1)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1048]  COND FALSE  !(( a0 <=  -147  && ((((((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4))) || ((a2==4) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1054]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (( a0 <=  -147  && ((a2==5) && (input == 1))) &&  43 < a29 )))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1059]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) )) && (a2==5)))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1072]  COND FALSE  !((((a2==2) && (((input == 4) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1084]  COND FALSE  !(((((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 )) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-192410, a2=2, a4=-89, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1091]  COND TRUE   ( a4 <=  -86  && (((input == 6) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&  -61 < a0 ))
[L1092]              a29 = ((((((a29 * 9)/ 10) % 29)- -14) + -303719) + 303718)
[L1093]              a2 = 3
[L1095]              return 26;
         VAL         [\result=26, a0=-44, a29=3, a2=3, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1784]  RET, EXPR   calculate_output(input)
[L1784]              output = calculate_output(input)
[L1776]  COND TRUE   1
[L1779]              int input;
[L1780]              input = __VERIFIER_nondet_int()
[L1781]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L1784]  CALL, EXPR  calculate_output(input)
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  -61 < a0 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L214]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L218]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 1) && (((a2==3) &&  a29 <=  -144 ) || (((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L224]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L229]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==2) && ( a29 <=  -144  && (input == 3))) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L239]   COND FALSE  !((( a0 <=  -147  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L244]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L251]   COND FALSE  !(((((a2==3) && ((input == 3) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&  -61 < a0 ) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L257]   COND FALSE  !(((((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L263]   COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 ))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270]   COND FALSE  !((( -61 < a0  && ((((a2==3) &&  a29 <=  -144 ) || ((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ( 43 < a29  && (a2==2)))) && (input == 2))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L276]   COND FALSE  !(((((a2==4) && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L283]   COND FALSE  !((((((input == 4) &&  43 < a29 ) && (a2==1)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L288]   COND FALSE  !((( -61 < a0  && (((( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 1))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L295]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==3)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L302]   COND FALSE  !((((a2==2) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L309]   COND FALSE  !((((((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316]   COND FALSE  !(((a2==4) && ( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330]   COND FALSE  !((((((input == 3) &&  -61 < a0 ) &&  a4 <=  -86 ) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==5)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L337]   COND FALSE  !(((a2==1) && ( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L343]   COND FALSE  !((( -61 < a0  && ( 43 < a29  && ((input == 4) && (a2==5)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L346]   COND FALSE  !(((((((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4)))) && (input == 5)) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L351]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L360]   COND FALSE  !(( 43 < a29  && (( -61 < a0  && ( a4 <=  -86  && (input == 1))) && (a2==5))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L365]   COND FALSE  !((( a4 <=  -86  && ( 43 < a29  && ((input == 2) &&  -61 < a0 ))) && (a2==3)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L371]   COND FALSE  !(((((input == 6) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L377]   COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 3)) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L383]   COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L390]   COND FALSE  !(((( a4 <=  -86  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L394]   COND FALSE  !(( -61 < a0  && ((( 43 < a29  && (input == 6)) && (a2==5)) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L400]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==5)))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4)))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L425]   COND FALSE  !(((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 ) && (input == 6)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L432]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==3) && (((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L438]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 5) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 )) && (a2==5)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L443]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==3) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L449]   COND FALSE  !(((((a2==3) && ((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L455]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L459]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==4)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L466]   COND FALSE  !(((((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 2)) &&  a4 <=  -86 ) &&  -61 < a0 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L472]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((  ((-98 < a0) && (-61 >= a0))  && (input == 6)) && (a2==2))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L478]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ( a4 <=  -86  && (((input == 6) &&  -61 < a0 ) && (a2==5)))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L484]   COND FALSE  !(((  ((-16 < a29) && (43 >= a29))  && (((input == 4) &&  -61 < a0 ) &&  a4 <=  -86 )) && (a2==5)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L489]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ((a2==2) &&  43 < a29 )) || ( a29 <=  -144  && (a2==3)))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L496]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((input == 1) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==2)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L501]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 6) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) && (a2==2)))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L507]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((input == 3) && (((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 ))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L512]   COND FALSE  !(((( a0 <=  -147  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L517]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L524]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ( a29 <=  -144  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 3) && (a2==5))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L530]   COND FALSE  !(((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && (((input == 5) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L539]   COND FALSE  !((((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L552]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && ( a0 <=  -147  && (  ((-16 < a29) && (43 >= a29))  && (input == 5))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L556]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2)))) && (input == 4)))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L567]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==2) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2)) &&   ((-98 < a0) && (-61 >= a0)) ))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L579]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==5) && ( 43 < a29  && (input == 3))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L584]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((a2==3) && (input == 4)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L597]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 )) || ((a2==2) &&  a29 <=  -144 )) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L604]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L616]   COND FALSE  !((((a2==2) && ((  ((-144 < a29) && (-16 >= a29))  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L623]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 6) && (((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L630]   COND FALSE  !(((((a2==1) && ((input == 5) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L637]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )))) && (a2==2)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L644]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (( a0 <=  -147  && (input == 2)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L651]   COND FALSE  !(((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L662]   COND FALSE  !(((((a2==1) && ((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L667]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==1) && ((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L672]   COND FALSE  !(( a0 <=  -147  && ((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 2))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L678]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 )) || ((a2==3) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L685]   COND FALSE  !(((((a2==5) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L691]   COND FALSE  !(((a2==2) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L697]   COND FALSE  !(((( a4 <=  -86  && ( -61 < a0  && (input == 5))) && (a2==5)) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L703]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L717]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L722]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) &&   ((-98 < a0) && (-61 >= a0)) )) &&  a29 <=  -144 ) && (a2==2)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L728]   COND FALSE  !(((a2==1) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L735]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((((a2==4) &&  43 < a29 ) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 3)))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L742]   COND FALSE  !((((a2==5) && (((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L745]   COND FALSE  !((((  ((-16 < a29) && (43 >= a29))  && ((input == 1) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L752]   COND FALSE  !((( a4 <=  -86  && ((input == 6) && ((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ((a2==2) &&  43 < a29 )) || ((a2==3) &&  a29 <=  -144 )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L758]   COND FALSE  !(((( -61 < a0  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 5))) &&  a4 <=  -86 ) && (a2==3)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L764]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 ))) && (input == 5)))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L771]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 6) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) &&  43 < a29 )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L778]   COND FALSE  !(( a0 <=  -147  && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L784]   COND FALSE  !(((((a2==1) && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L789]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && ((a2==4) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L796]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L803]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  && (a2==2)) || ((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 ))) && (input == 4))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L814]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L821]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==2))) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L827]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==3) && (  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L834]   COND FALSE  !(((a2==5) && ((( a0 <=  -147  && (input == 5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L839]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && (input == 3))) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L850]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==4) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L855]   COND FALSE  !((( a4 <=  -86  && ((input == 3) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L861]   COND FALSE  !(((a2==4) && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L865]   COND FALSE  !(((a2==5) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L872]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) &&  43 < a29 ) || ( a29 <=  -144  && (a2==3)))) && (input == 1))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L878]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) &&  a0 <=  -147 ) && (a2==5))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L884]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && ((input == 5) && ((( 43 < a29  && (a2==4)) || ( a29 <=  -144  && (a2==5))) || ((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=3, a2=3, a4=-89, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L890]   COND TRUE   ((a2==3) && ( a4 <=  -86  && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  -61 < a0 )))
[L891]               a29 = (((a29 * 5) - -271226) / 5)
[L892]               a2 = 5
[L894]               return 21;
         VAL         [\result=21, a0=-44, a29=54248, a2=5, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1784]  RET, EXPR   calculate_output(input)
[L1784]              output = calculate_output(input)
[L1776]  COND TRUE   1
[L1779]              int input;
[L1780]              input = __VERIFIER_nondet_int()
[L1781]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L1784]  CALL, EXPR  calculate_output(input)
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  -61 < a0 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L214]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L218]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 1) && (((a2==3) &&  a29 <=  -144 ) || (((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L224]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L229]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==2) && ( a29 <=  -144  && (input == 3))) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L239]   COND FALSE  !((( a0 <=  -147  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L244]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L251]   COND FALSE  !(((((a2==3) && ((input == 3) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&  -61 < a0 ) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L257]   COND FALSE  !(((((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L263]   COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 ))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270]   COND FALSE  !((( -61 < a0  && ((((a2==3) &&  a29 <=  -144 ) || ((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ( 43 < a29  && (a2==2)))) && (input == 2))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L276]   COND FALSE  !(((((a2==4) && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L283]   COND FALSE  !((((((input == 4) &&  43 < a29 ) && (a2==1)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L288]   COND FALSE  !((( -61 < a0  && (((( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 1))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L295]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==3)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L302]   COND FALSE  !((((a2==2) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L309]   COND FALSE  !((((((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316]   COND FALSE  !(((a2==4) && ( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330]   COND FALSE  !((((((input == 3) &&  -61 < a0 ) &&  a4 <=  -86 ) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==5)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L337]   COND FALSE  !(((a2==1) && ( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L343]   COND FALSE  !((( -61 < a0  && ( 43 < a29  && ((input == 4) && (a2==5)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L346]   COND FALSE  !(((((((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4)))) && (input == 5)) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L351]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L360]   COND FALSE  !(( 43 < a29  && (( -61 < a0  && ( a4 <=  -86  && (input == 1))) && (a2==5))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L365]   COND FALSE  !((( a4 <=  -86  && ( 43 < a29  && ((input == 2) &&  -61 < a0 ))) && (a2==3)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L371]   COND FALSE  !(((((input == 6) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L377]   COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 3)) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L383]   COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L390]   COND FALSE  !(((( a4 <=  -86  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L394]   COND FALSE  !(( -61 < a0  && ((( 43 < a29  && (input == 6)) && (a2==5)) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L400]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==5)))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4)))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L425]   COND FALSE  !(((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 ) && (input == 6)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L432]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==3) && (((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L438]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 5) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 )) && (a2==5)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L443]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==3) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L449]   COND FALSE  !(((((a2==3) && ((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L455]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L459]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==4)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L466]   COND FALSE  !(((((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 2)) &&  a4 <=  -86 ) &&  -61 < a0 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L472]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((  ((-98 < a0) && (-61 >= a0))  && (input == 6)) && (a2==2))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L478]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ( a4 <=  -86  && (((input == 6) &&  -61 < a0 ) && (a2==5)))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L484]   COND FALSE  !(((  ((-16 < a29) && (43 >= a29))  && (((input == 4) &&  -61 < a0 ) &&  a4 <=  -86 )) && (a2==5)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L489]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ((a2==2) &&  43 < a29 )) || ( a29 <=  -144  && (a2==3)))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L496]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((input == 1) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==2)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L501]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 6) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) && (a2==2)))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L507]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((input == 3) && (((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 ))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L512]   COND FALSE  !(((( a0 <=  -147  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L517]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L524]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ( a29 <=  -144  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 3) && (a2==5))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L530]   COND FALSE  !(((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && (((input == 5) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L539]   COND FALSE  !((((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L552]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && ( a0 <=  -147  && (  ((-16 < a29) && (43 >= a29))  && (input == 5))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L556]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2)))) && (input == 4)))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L567]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==2) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2)) &&   ((-98 < a0) && (-61 >= a0)) ))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L579]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==5) && ( 43 < a29  && (input == 3))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L584]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((a2==3) && (input == 4)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L597]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 )) || ((a2==2) &&  a29 <=  -144 )) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L604]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L616]   COND FALSE  !((((a2==2) && ((  ((-144 < a29) && (-16 >= a29))  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L623]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 6) && (((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L630]   COND FALSE  !(((((a2==1) && ((input == 5) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L637]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )))) && (a2==2)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L644]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (( a0 <=  -147  && (input == 2)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L651]   COND FALSE  !(((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L662]   COND FALSE  !(((((a2==1) && ((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L667]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==1) && ((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L672]   COND FALSE  !(( a0 <=  -147  && ((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 2))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L678]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 )) || ((a2==3) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L685]   COND FALSE  !(((((a2==5) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L691]   COND FALSE  !(((a2==2) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L697]   COND FALSE  !(((( a4 <=  -86  && ( -61 < a0  && (input == 5))) && (a2==5)) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L703]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L717]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L722]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) &&   ((-98 < a0) && (-61 >= a0)) )) &&  a29 <=  -144 ) && (a2==2)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L728]   COND FALSE  !(((a2==1) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L735]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((((a2==4) &&  43 < a29 ) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 3)))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L742]   COND FALSE  !((((a2==5) && (((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L745]   COND FALSE  !((((  ((-16 < a29) && (43 >= a29))  && ((input == 1) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L752]   COND FALSE  !((( a4 <=  -86  && ((input == 6) && ((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ((a2==2) &&  43 < a29 )) || ((a2==3) &&  a29 <=  -144 )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L758]   COND FALSE  !(((( -61 < a0  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 5))) &&  a4 <=  -86 ) && (a2==3)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L764]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 ))) && (input == 5)))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L771]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 6) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) &&  43 < a29 )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L778]   COND FALSE  !(( a0 <=  -147  && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L784]   COND FALSE  !(((((a2==1) && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L789]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && ((a2==4) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L796]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L803]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  && (a2==2)) || ((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 ))) && (input == 4))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L814]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L821]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==2))) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L827]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==3) && (  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L834]   COND FALSE  !(((a2==5) && ((( a0 <=  -147  && (input == 5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L839]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && (input == 3))) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L850]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==4) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L855]   COND FALSE  !((( a4 <=  -86  && ((input == 3) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L861]   COND FALSE  !(((a2==4) && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L865]   COND FALSE  !(((a2==5) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L872]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) &&  43 < a29 ) || ( a29 <=  -144  && (a2==3)))) && (input == 1))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L878]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) &&  a0 <=  -147 ) && (a2==5))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L884]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && ((input == 5) && ((( 43 < a29  && (a2==4)) || ( a29 <=  -144  && (a2==5))) || ((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L890]   COND FALSE  !(((a2==3) && ( a4 <=  -86  && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  -61 < a0 ))))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L895]   COND FALSE  !(((a2==5) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=54248, a2=5, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L905]   COND TRUE   (((( -61 < a0  && (input == 2)) &&  43 < a29 ) &&  a4 <=  -86 ) && (a2==5))
[L906]               a0 = (((((a0 - 0) % 18)- 79) + -287852) - -287851)
[L907]               a29 = ((((a29 + -432842) % 63)+ -79) * 1)
[L908]               a2 = 1
[L910]               return -1;
         VAL         [\result=-1, a0=-88, a29=-106, a2=1, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1784]  RET, EXPR   calculate_output(input)
[L1784]              output = calculate_output(input)
[L1776]  COND TRUE   1
[L1779]              int input;
[L1780]              input = __VERIFIER_nondet_int()
[L1781]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L1784]  CALL        calculate_output(input)
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94]    COND TRUE   ((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) )
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L95]                reach_error()
         VAL         [a0=-88, a29=-106, a2=1, a4=-89, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.8s, OverallIterations: 26, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8006 SdHoareTripleChecker+Valid, 27.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8006 mSDsluCounter, 9956 SdHoareTripleChecker+Invalid, 23.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1072 mSDsCounter, 4643 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27044 IncrementalHoareTripleChecker+Invalid, 31687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4643 mSolverCounterUnsat, 8884 mSDtfsCounter, 27044 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2025 GetRequests, 1986 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30323occurred in iteration=23, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 33713 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 13826 NumberOfCodeBlocks, 13826 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 12976 ConstructedInterpolants, 196 QuantifiedInterpolants, 41309 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2335 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 28 InterpolantComputations, 25 PerfectInterpolantSequences, 11630/12363 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2025-03-03 10:52:41,048 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE