./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label54.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 11e41592a4a90a36b9d41c817b9251e7ae28a6a8e3ac5da0511d1aedc7736ffe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:15:37,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:15:37,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:15:37,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:15:37,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:15:37,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:15:37,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:15:37,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:15:37,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:15:37,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:15:37,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:15:37,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:15:37,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:15:37,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:15:37,096 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:15:37,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:15:37,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:15:37,097 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:15:37,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:15:37,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:15:37,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:15:37,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:15:37,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:15:37,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:15:37,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:15:37,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:15:37,098 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:15:37,098 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:15:37,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:15:37,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:15:37,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:15:37,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:15:37,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:37,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:15:37,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:37,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:15:37,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:15:37,100 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-jdk21/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 -> 11e41592a4a90a36b9d41c817b9251e7ae28a6a8e3ac5da0511d1aedc7736ffe [2025-01-09 00:15:37,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:15:37,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:15:37,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:15:37,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:15:37,337 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:15:37,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label54.c [2025-01-09 00:15:38,522 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e827170a8/b27587681a194c93a59fd07e3a882693/FLAG7dcbbc09f [2025-01-09 00:15:38,826 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:15:38,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label54.c [2025-01-09 00:15:38,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e827170a8/b27587681a194c93a59fd07e3a882693/FLAG7dcbbc09f [2025-01-09 00:15:38,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e827170a8/b27587681a194c93a59fd07e3a882693 [2025-01-09 00:15:38,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:15:38,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:15:38,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:15:38,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:15:38,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:15:38,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:38" (1/1) ... [2025-01-09 00:15:38,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32dcde73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:38, skipping insertion in model container [2025-01-09 00:15:38,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:38" (1/1) ... [2025-01-09 00:15:38,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:15:39,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label54.c[2072,2085] [2025-01-09 00:15:39,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:15:39,475 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:15:39,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label54.c[2072,2085] [2025-01-09 00:15:39,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:15:39,676 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:15:39,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39 WrapperNode [2025-01-09 00:15:39,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:15:39,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:15:39,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:15:39,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:15:39,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:39,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:39,887 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:15:39,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:15:39,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:15:39,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:15:39,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:15:39,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:39,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:39,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:40,062 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-01-09 00:15:40,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:40,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:40,115 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:40,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:40,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:40,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:40,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:40,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:15:40,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:15:40,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:15:40,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:15:40,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (1/1) ... [2025-01-09 00:15:40,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:40,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:40,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:15:40,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:15:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:15:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:15:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:15:40,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:15:40,321 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:15:40,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:15:43,051 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:15:43,052 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:15:43,074 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:15:43,074 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:15:43,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:43 BoogieIcfgContainer [2025-01-09 00:15:43,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:15:43,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:15:43,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:15:43,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:15:43,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:15:38" (1/3) ... [2025-01-09 00:15:43,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e175959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:15:43, skipping insertion in model container [2025-01-09 00:15:43,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:39" (2/3) ... [2025-01-09 00:15:43,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e175959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:15:43, skipping insertion in model container [2025-01-09 00:15:43,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:43" (3/3) ... [2025-01-09 00:15:43,086 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label54.c [2025-01-09 00:15:43,096 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:15:43,098 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label54.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:15:43,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:15:43,162 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;@7480c649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:15:43,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:15:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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-01-09 00:15:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 00:15:43,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:43,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:43,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:43,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash 948886500, now seen corresponding path program 1 times [2025-01-09 00:15:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:43,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845873060] [2025-01-09 00:15:43,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:43,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:15:43,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 00:15:43,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:43,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:43,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:43,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845873060] [2025-01-09 00:15:43,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845873060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:43,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:43,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:43,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723849680] [2025-01-09 00:15:43,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:43,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:43,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:43,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:43,368 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-01-09 00:15:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:45,393 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-01-09 00:15:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:45,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-01-09 00:15:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:45,431 INFO L225 Difference]: With dead ends: 1667 [2025-01-09 00:15:45,431 INFO L226 Difference]: Without dead ends: 998 [2025-01-09 00:15:45,441 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-01-09 00:15:45,443 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 532 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:45,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 277 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:15:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-01-09 00:15:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-01-09 00:15:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-01-09 00:15:45,559 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 13 [2025-01-09 00:15:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:45,560 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-01-09 00:15:45,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-01-09 00:15:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-01-09 00:15:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 00:15:45,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:45,561 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:15:45,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:15:45,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:45,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:45,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1394944403, now seen corresponding path program 1 times [2025-01-09 00:15:45,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:45,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822722547] [2025-01-09 00:15:45,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:45,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 00:15:45,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 00:15:45,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:45,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:45,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:45,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822722547] [2025-01-09 00:15:45,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822722547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:45,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:45,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:45,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120306821] [2025-01-09 00:15:45,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:45,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:45,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:45,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:45,824 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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-01-09 00:15:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:47,679 INFO L93 Difference]: Finished difference Result 2840 states and 4882 transitions. [2025-01-09 00:15:47,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:47,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-01-09 00:15:47,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:47,686 INFO L225 Difference]: With dead ends: 2840 [2025-01-09 00:15:47,686 INFO L226 Difference]: Without dead ends: 1860 [2025-01-09 00:15:47,689 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-01-09 00:15:47,690 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 405 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:47,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 503 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:15:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-01-09 00:15:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1854. [2025-01-09 00:15:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.4889368591473287) internal successors, (2759), 1853 states have internal predecessors, (2759), 0 states have call successors, (0), 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-01-09 00:15:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2759 transitions. [2025-01-09 00:15:47,730 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2759 transitions. Word has length 78 [2025-01-09 00:15:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:47,731 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2759 transitions. [2025-01-09 00:15:47,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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-01-09 00:15:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2759 transitions. [2025-01-09 00:15:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 00:15:47,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:47,733 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:15:47,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:15:47,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:47,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 385189126, now seen corresponding path program 1 times [2025-01-09 00:15:47,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:47,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468035475] [2025-01-09 00:15:47,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:47,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:47,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 00:15:47,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 00:15:47,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:47,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468035475] [2025-01-09 00:15:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468035475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125522068] [2025-01-09 00:15:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:47,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:47,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:47,998 INFO L87 Difference]: Start difference. First operand 1854 states and 2759 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 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-01-09 00:15:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:49,791 INFO L93 Difference]: Finished difference Result 4997 states and 7381 transitions. [2025-01-09 00:15:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:49,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-01-09 00:15:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:49,802 INFO L225 Difference]: With dead ends: 4997 [2025-01-09 00:15:49,802 INFO L226 Difference]: Without dead ends: 3145 [2025-01-09 00:15:49,804 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-01-09 00:15:49,805 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 370 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:49,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 559 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:15:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2025-01-09 00:15:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 3141. [2025-01-09 00:15:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.320063694267516) internal successors, (4145), 3140 states have internal predecessors, (4145), 0 states have call successors, (0), 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-01-09 00:15:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4145 transitions. [2025-01-09 00:15:49,856 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4145 transitions. Word has length 88 [2025-01-09 00:15:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:49,856 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4145 transitions. [2025-01-09 00:15:49,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 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-01-09 00:15:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4145 transitions. [2025-01-09 00:15:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 00:15:49,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:49,859 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:49,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:15:49,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:49,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash 202946650, now seen corresponding path program 1 times [2025-01-09 00:15:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:49,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394732439] [2025-01-09 00:15:49,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:49,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:49,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 00:15:49,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 00:15:49,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:49,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 00:15:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394732439] [2025-01-09 00:15:50,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394732439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:50,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:50,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:50,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623743075] [2025-01-09 00:15:50,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:50,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:50,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:50,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:50,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:50,139 INFO L87 Difference]: Start difference. First operand 3141 states and 4145 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 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-01-09 00:15:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:51,777 INFO L93 Difference]: Finished difference Result 8416 states and 11326 transitions. [2025-01-09 00:15:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:51,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 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 148 [2025-01-09 00:15:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:51,798 INFO L225 Difference]: With dead ends: 8416 [2025-01-09 00:15:51,798 INFO L226 Difference]: Without dead ends: 5702 [2025-01-09 00:15:51,802 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-01-09 00:15:51,805 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:51,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:15:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2025-01-09 00:15:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 3999. [2025-01-09 00:15:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3998 states have (on average 1.251375687843922) internal successors, (5003), 3998 states have internal predecessors, (5003), 0 states have call successors, (0), 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-01-09 00:15:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5003 transitions. [2025-01-09 00:15:51,885 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5003 transitions. Word has length 148 [2025-01-09 00:15:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:51,885 INFO L471 AbstractCegarLoop]: Abstraction has 3999 states and 5003 transitions. [2025-01-09 00:15:51,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 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-01-09 00:15:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5003 transitions. [2025-01-09 00:15:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 00:15:51,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:51,890 INFO L218 NwaCegarLoop]: trace histogram [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, 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-01-09 00:15:51,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:15:51,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:51,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash 172156535, now seen corresponding path program 1 times [2025-01-09 00:15:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:51,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110798795] [2025-01-09 00:15:51,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:51,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 00:15:51,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 00:15:51,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:51,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:52,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:52,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110798795] [2025-01-09 00:15:52,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110798795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:52,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:52,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:15:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362230794] [2025-01-09 00:15:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:52,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:15:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:52,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:15:52,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:15:52,258 INFO L87 Difference]: Start difference. First operand 3999 states and 5003 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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-01-09 00:15:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:54,228 INFO L93 Difference]: Finished difference Result 10144 states and 13054 transitions. [2025-01-09 00:15:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:54,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-01-09 00:15:54,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:54,246 INFO L225 Difference]: With dead ends: 10144 [2025-01-09 00:15:54,246 INFO L226 Difference]: Without dead ends: 6147 [2025-01-09 00:15:54,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:15:54,253 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 594 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:54,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 915 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:15:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2025-01-09 00:15:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 6134. [2025-01-09 00:15:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6133 states have (on average 1.24392630034241) internal successors, (7629), 6133 states have internal predecessors, (7629), 0 states have call successors, (0), 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-01-09 00:15:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 7629 transitions. [2025-01-09 00:15:54,402 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 7629 transitions. Word has length 161 [2025-01-09 00:15:54,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:54,403 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 7629 transitions. [2025-01-09 00:15:54,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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-01-09 00:15:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 7629 transitions. [2025-01-09 00:15:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 00:15:54,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:54,408 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:54,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:15:54,409 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:54,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:54,409 INFO L85 PathProgramCache]: Analyzing trace with hash 94515334, now seen corresponding path program 1 times [2025-01-09 00:15:54,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:54,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925255220] [2025-01-09 00:15:54,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:54,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:54,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 00:15:54,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 00:15:54,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:54,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:15:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925255220] [2025-01-09 00:15:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925255220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532917623] [2025-01-09 00:15:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:54,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:54,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:54,698 INFO L87 Difference]: Start difference. First operand 6134 states and 7629 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:56,539 INFO L93 Difference]: Finished difference Result 15299 states and 19117 transitions. [2025-01-09 00:15:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:56,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2025-01-09 00:15:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:56,561 INFO L225 Difference]: With dead ends: 15299 [2025-01-09 00:15:56,562 INFO L226 Difference]: Without dead ends: 9167 [2025-01-09 00:15:56,567 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-01-09 00:15:56,568 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 540 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:56,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 241 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:15:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9167 states. [2025-01-09 00:15:56,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9167 to 8716. [2025-01-09 00:15:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8716 states, 8715 states have (on average 1.2578313253012048) internal successors, (10962), 8715 states have internal predecessors, (10962), 0 states have call successors, (0), 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-01-09 00:15:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8716 states to 8716 states and 10962 transitions. [2025-01-09 00:15:56,684 INFO L78 Accepts]: Start accepts. Automaton has 8716 states and 10962 transitions. Word has length 167 [2025-01-09 00:15:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:56,684 INFO L471 AbstractCegarLoop]: Abstraction has 8716 states and 10962 transitions. [2025-01-09 00:15:56,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8716 states and 10962 transitions. [2025-01-09 00:15:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-09 00:15:56,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:56,687 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:56,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:15:56,688 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:56,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1274287382, now seen corresponding path program 1 times [2025-01-09 00:15:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:56,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248097965] [2025-01-09 00:15:56,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:56,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:56,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 00:15:56,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 00:15:56,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:56,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:15:56,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:56,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248097965] [2025-01-09 00:15:56,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248097965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:56,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:56,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:56,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363819984] [2025-01-09 00:15:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:56,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:56,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:56,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:56,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:56,884 INFO L87 Difference]: Start difference. First operand 8716 states and 10962 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-01-09 00:15:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:58,508 INFO L93 Difference]: Finished difference Result 22092 states and 28122 transitions. [2025-01-09 00:15:58,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:58,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 250 [2025-01-09 00:15:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:58,526 INFO L225 Difference]: With dead ends: 22092 [2025-01-09 00:15:58,526 INFO L226 Difference]: Without dead ends: 11677 [2025-01-09 00:15:58,533 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-01-09 00:15:58,534 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 394 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:58,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 943 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:15:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11677 states. [2025-01-09 00:15:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11677 to 11677. [2025-01-09 00:15:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11677 states, 11676 states have (on average 1.1531346351490237) internal successors, (13464), 11676 states have internal predecessors, (13464), 0 states have call successors, (0), 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-01-09 00:15:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11677 states to 11677 states and 13464 transitions. [2025-01-09 00:15:58,652 INFO L78 Accepts]: Start accepts. Automaton has 11677 states and 13464 transitions. Word has length 250 [2025-01-09 00:15:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:58,652 INFO L471 AbstractCegarLoop]: Abstraction has 11677 states and 13464 transitions. [2025-01-09 00:15:58,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-01-09 00:15:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 11677 states and 13464 transitions. [2025-01-09 00:15:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 00:15:58,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:58,659 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:15:58,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:15:58,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:58,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash -31030352, now seen corresponding path program 1 times [2025-01-09 00:15:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:58,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70882548] [2025-01-09 00:15:58,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:58,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 00:15:58,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 00:15:58,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:58,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:15:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:58,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70882548] [2025-01-09 00:15:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70882548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:58,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:58,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:58,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927177319] [2025-01-09 00:15:58,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:58,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:58,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:58,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:58,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:58,848 INFO L87 Difference]: Start difference. First operand 11677 states and 13464 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:00,215 INFO L93 Difference]: Finished difference Result 28048 states and 32214 transitions. [2025-01-09 00:16:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:00,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2025-01-09 00:16:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:00,236 INFO L225 Difference]: With dead ends: 28048 [2025-01-09 00:16:00,236 INFO L226 Difference]: Without dead ends: 15098 [2025-01-09 00:16:00,242 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-01-09 00:16:00,243 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 441 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:00,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 935 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:16:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15098 states. [2025-01-09 00:16:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15098 to 15092. [2025-01-09 00:16:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15092 states, 15091 states have (on average 1.130673911602942) internal successors, (17063), 15091 states have internal predecessors, (17063), 0 states have call successors, (0), 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-01-09 00:16:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15092 states to 15092 states and 17063 transitions. [2025-01-09 00:16:00,371 INFO L78 Accepts]: Start accepts. Automaton has 15092 states and 17063 transitions. Word has length 270 [2025-01-09 00:16:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:00,373 INFO L471 AbstractCegarLoop]: Abstraction has 15092 states and 17063 transitions. [2025-01-09 00:16:00,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:16:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 15092 states and 17063 transitions. [2025-01-09 00:16:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-01-09 00:16:00,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:00,379 INFO L218 NwaCegarLoop]: trace histogram [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, 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-01-09 00:16:00,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:16:00,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:00,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 953877907, now seen corresponding path program 1 times [2025-01-09 00:16:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:00,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486968060] [2025-01-09 00:16:00,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:00,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 00:16:00,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 00:16:00,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:00,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-01-09 00:16:00,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:00,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486968060] [2025-01-09 00:16:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486968060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761102043] [2025-01-09 00:16:00,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:00,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:00,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:00,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:00,712 INFO L87 Difference]: Start difference. First operand 15092 states and 17063 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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-01-09 00:16:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:02,174 INFO L93 Difference]: Finished difference Result 36996 states and 42322 transitions. [2025-01-09 00:16:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 303 [2025-01-09 00:16:02,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:02,202 INFO L225 Difference]: With dead ends: 36996 [2025-01-09 00:16:02,203 INFO L226 Difference]: Without dead ends: 20628 [2025-01-09 00:16:02,213 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-01-09 00:16:02,217 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 463 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:02,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 820 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:16:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20628 states. [2025-01-09 00:16:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20628 to 17210. [2025-01-09 00:16:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17210 states, 17209 states have (on average 1.1224940438142832) internal successors, (19317), 17209 states have internal predecessors, (19317), 0 states have call successors, (0), 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-01-09 00:16:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17210 states to 17210 states and 19317 transitions. [2025-01-09 00:16:02,391 INFO L78 Accepts]: Start accepts. Automaton has 17210 states and 19317 transitions. Word has length 303 [2025-01-09 00:16:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:02,391 INFO L471 AbstractCegarLoop]: Abstraction has 17210 states and 19317 transitions. [2025-01-09 00:16:02,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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-01-09 00:16:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 17210 states and 19317 transitions. [2025-01-09 00:16:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 00:16:02,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:02,396 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-09 00:16:02,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:16:02,396 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:02,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1311088936, now seen corresponding path program 1 times [2025-01-09 00:16:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391764874] [2025-01-09 00:16:02,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:02,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 00:16:02,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 00:16:02,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:02,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:16:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:02,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391764874] [2025-01-09 00:16:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391764874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018249492] [2025-01-09 00:16:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:02,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:02,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:02,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:02,649 INFO L87 Difference]: Start difference. First operand 17210 states and 19317 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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-01-09 00:16:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:04,168 INFO L93 Difference]: Finished difference Result 39550 states and 44788 transitions. [2025-01-09 00:16:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:04,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2025-01-09 00:16:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:04,190 INFO L225 Difference]: With dead ends: 39550 [2025-01-09 00:16:04,190 INFO L226 Difference]: Without dead ends: 21059 [2025-01-09 00:16:04,205 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-01-09 00:16:04,206 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 463 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:04,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 860 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:16:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21059 states. [2025-01-09 00:16:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21059 to 21052. [2025-01-09 00:16:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21052 states, 21051 states have (on average 1.1219419505011639) internal successors, (23618), 21051 states have internal predecessors, (23618), 0 states have call successors, (0), 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-01-09 00:16:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21052 states to 21052 states and 23618 transitions. [2025-01-09 00:16:04,389 INFO L78 Accepts]: Start accepts. Automaton has 21052 states and 23618 transitions. Word has length 325 [2025-01-09 00:16:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:04,390 INFO L471 AbstractCegarLoop]: Abstraction has 21052 states and 23618 transitions. [2025-01-09 00:16:04,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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-01-09 00:16:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21052 states and 23618 transitions. [2025-01-09 00:16:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-01-09 00:16:04,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:04,396 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-09 00:16:04,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:16:04,396 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:04,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1713686211, now seen corresponding path program 1 times [2025-01-09 00:16:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423979944] [2025-01-09 00:16:04,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:04,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-01-09 00:16:04,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-01-09 00:16:04,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:04,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:16:04,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:04,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423979944] [2025-01-09 00:16:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423979944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:04,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:04,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:04,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386350634] [2025-01-09 00:16:04,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:04,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:04,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:04,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:04,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:04,672 INFO L87 Difference]: Start difference. First operand 21052 states and 23618 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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-01-09 00:16:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:06,181 INFO L93 Difference]: Finished difference Result 48101 states and 53987 transitions. [2025-01-09 00:16:06,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:06,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 376 [2025-01-09 00:16:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:06,206 INFO L225 Difference]: With dead ends: 48101 [2025-01-09 00:16:06,207 INFO L226 Difference]: Without dead ends: 27051 [2025-01-09 00:16:06,219 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-01-09 00:16:06,220 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 520 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:06,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 190 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:16:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27051 states. [2025-01-09 00:16:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27051 to 21046. [2025-01-09 00:16:06,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21046 states, 21045 states have (on average 1.122024233784747) internal successors, (23613), 21045 states have internal predecessors, (23613), 0 states have call successors, (0), 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-01-09 00:16:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21046 states to 21046 states and 23613 transitions. [2025-01-09 00:16:06,392 INFO L78 Accepts]: Start accepts. Automaton has 21046 states and 23613 transitions. Word has length 376 [2025-01-09 00:16:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:06,394 INFO L471 AbstractCegarLoop]: Abstraction has 21046 states and 23613 transitions. [2025-01-09 00:16:06,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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-01-09 00:16:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21046 states and 23613 transitions. [2025-01-09 00:16:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-01-09 00:16:06,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:06,400 INFO L218 NwaCegarLoop]: trace histogram [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, 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-01-09 00:16:06,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:16:06,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1158772661, now seen corresponding path program 1 times [2025-01-09 00:16:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191933541] [2025-01-09 00:16:06,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:06,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-09 00:16:06,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-09 00:16:06,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:06,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 00:16:07,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:07,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191933541] [2025-01-09 00:16:07,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191933541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:07,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:07,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:07,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353835534] [2025-01-09 00:16:07,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:07,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:07,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:07,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:07,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:07,030 INFO L87 Difference]: Start difference. First operand 21046 states and 23613 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-01-09 00:16:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:08,476 INFO L93 Difference]: Finished difference Result 49791 states and 56363 transitions. [2025-01-09 00:16:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:08,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 422 [2025-01-09 00:16:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:08,506 INFO L225 Difference]: With dead ends: 49791 [2025-01-09 00:16:08,506 INFO L226 Difference]: Without dead ends: 27025 [2025-01-09 00:16:08,517 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-01-09 00:16:08,517 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 520 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:08,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 778 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:16:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27025 states. [2025-01-09 00:16:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27025 to 27016. [2025-01-09 00:16:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27016 states, 27015 states have (on average 1.1262631871182676) internal successors, (30426), 27015 states have internal predecessors, (30426), 0 states have call successors, (0), 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-01-09 00:16:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27016 states to 27016 states and 30426 transitions. [2025-01-09 00:16:08,728 INFO L78 Accepts]: Start accepts. Automaton has 27016 states and 30426 transitions. Word has length 422 [2025-01-09 00:16:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 27016 states and 30426 transitions. [2025-01-09 00:16:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-01-09 00:16:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 27016 states and 30426 transitions. [2025-01-09 00:16:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-01-09 00:16:08,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:08,736 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:16:08,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:16:08,736 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:08,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash 591864301, now seen corresponding path program 1 times [2025-01-09 00:16:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:08,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052620499] [2025-01-09 00:16:08,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:08,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:08,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-09 00:16:08,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-09 00:16:08,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:08,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 21 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052620499] [2025-01-09 00:16:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052620499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887045329] [2025-01-09 00:16:09,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:09,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:09,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:09,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:16:09,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:16:09,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-09 00:16:09,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-09 00:16:09,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:09,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:09,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:16:09,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 21 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:09,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:16:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:10,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887045329] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:10,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:16:10,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:16:10,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089739055] [2025-01-09 00:16:10,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:10,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:10,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:10,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:10,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:16:10,393 INFO L87 Difference]: Start difference. First operand 27016 states and 30426 transitions. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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-01-09 00:16:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:12,656 INFO L93 Difference]: Finished difference Result 67248 states and 76382 transitions. [2025-01-09 00:16:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:12,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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 444 [2025-01-09 00:16:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:12,696 INFO L225 Difference]: With dead ends: 67248 [2025-01-09 00:16:12,696 INFO L226 Difference]: Without dead ends: 38521 [2025-01-09 00:16:12,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 885 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:16:12,715 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 726 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:12,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 152 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:16:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38521 states. [2025-01-09 00:16:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38521 to 32531. [2025-01-09 00:16:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32531 states, 32530 states have (on average 1.132216415616354) internal successors, (36831), 32530 states have internal predecessors, (36831), 0 states have call successors, (0), 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-01-09 00:16:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32531 states to 32531 states and 36831 transitions. [2025-01-09 00:16:13,105 INFO L78 Accepts]: Start accepts. Automaton has 32531 states and 36831 transitions. Word has length 444 [2025-01-09 00:16:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 32531 states and 36831 transitions. [2025-01-09 00:16:13,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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-01-09 00:16:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 32531 states and 36831 transitions. [2025-01-09 00:16:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-01-09 00:16:13,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:13,117 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:13,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 00:16:13,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 00:16:13,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:13,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1756214342, now seen corresponding path program 1 times [2025-01-09 00:16:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128910670] [2025-01-09 00:16:13,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:13,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-01-09 00:16:13,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-01-09 00:16:13,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:13,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 00:16:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128910670] [2025-01-09 00:16:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128910670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:13,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:13,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929472032] [2025-01-09 00:16:13,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:13,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:13,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:13,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:13,626 INFO L87 Difference]: Start difference. First operand 32531 states and 36831 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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-01-09 00:16:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:14,833 INFO L93 Difference]: Finished difference Result 74863 states and 84901 transitions. [2025-01-09 00:16:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:14,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 487 [2025-01-09 00:16:14,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:14,874 INFO L225 Difference]: With dead ends: 74863 [2025-01-09 00:16:14,874 INFO L226 Difference]: Without dead ends: 42333 [2025-01-09 00:16:14,890 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-01-09 00:16:14,891 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 464 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:14,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 386 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:16:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42333 states. [2025-01-09 00:16:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42333 to 40192. [2025-01-09 00:16:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40192 states, 40191 states have (on average 1.123734169341395) internal successors, (45164), 40191 states have internal predecessors, (45164), 0 states have call successors, (0), 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-01-09 00:16:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40192 states to 40192 states and 45164 transitions. [2025-01-09 00:16:15,262 INFO L78 Accepts]: Start accepts. Automaton has 40192 states and 45164 transitions. Word has length 487 [2025-01-09 00:16:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:15,262 INFO L471 AbstractCegarLoop]: Abstraction has 40192 states and 45164 transitions. [2025-01-09 00:16:15,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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-01-09 00:16:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 40192 states and 45164 transitions. [2025-01-09 00:16:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 00:16:15,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:15,274 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:15,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:16:15,274 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:15,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1119138902, now seen corresponding path program 1 times [2025-01-09 00:16:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:15,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886713713] [2025-01-09 00:16:15,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:15,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 00:16:15,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 00:16:15,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:15,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:15,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886713713] [2025-01-09 00:16:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886713713] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:15,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358478262] [2025-01-09 00:16:15,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:15,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:15,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:15,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:16:15,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:16:15,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 00:16:16,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 00:16:16,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:16,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:16,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:16:16,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 177 proven. 73 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 00:16:16,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:16:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 00:16:16,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358478262] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:16,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:16:16,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-01-09 00:16:16,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468918480] [2025-01-09 00:16:16,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:16,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:16,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:16,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:16,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:16:16,487 INFO L87 Difference]: Start difference. First operand 40192 states and 45164 transitions. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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-01-09 00:16:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:18,502 INFO L93 Difference]: Finished difference Result 98706 states and 111272 transitions. [2025-01-09 00:16:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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 518 [2025-01-09 00:16:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:18,563 INFO L225 Difference]: With dead ends: 98706 [2025-01-09 00:16:18,563 INFO L226 Difference]: Without dead ends: 58516 [2025-01-09 00:16:18,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1038 GetRequests, 1033 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:16:18,591 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 832 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:18,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 191 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:16:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58516 states. [2025-01-09 00:16:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58516 to 53404. [2025-01-09 00:16:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53404 states, 53403 states have (on average 1.1309851506469675) internal successors, (60398), 53403 states have internal predecessors, (60398), 0 states have call successors, (0), 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-01-09 00:16:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53404 states to 53404 states and 60398 transitions. [2025-01-09 00:16:19,268 INFO L78 Accepts]: Start accepts. Automaton has 53404 states and 60398 transitions. Word has length 518 [2025-01-09 00:16:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:19,268 INFO L471 AbstractCegarLoop]: Abstraction has 53404 states and 60398 transitions. [2025-01-09 00:16:19,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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-01-09 00:16:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 53404 states and 60398 transitions. [2025-01-09 00:16:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-01-09 00:16:19,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:19,285 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:16:19,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:16:19,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 00:16:19,486 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:19,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:19,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1065265766, now seen corresponding path program 1 times [2025-01-09 00:16:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:19,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790925086] [2025-01-09 00:16:19,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:19,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:19,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-01-09 00:16:19,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-01-09 00:16:19,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:19,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-01-09 00:16:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790925086] [2025-01-09 00:16:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790925086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:19,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:19,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220412368] [2025-01-09 00:16:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:19,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:19,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:19,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:19,646 INFO L87 Difference]: Start difference. First operand 53404 states and 60398 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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-01-09 00:16:21,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:21,213 INFO L93 Difference]: Finished difference Result 118286 states and 133831 transitions. [2025-01-09 00:16:21,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:21,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 613 [2025-01-09 00:16:21,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:21,279 INFO L225 Difference]: With dead ends: 118286 [2025-01-09 00:16:21,279 INFO L226 Difference]: Without dead ends: 62323 [2025-01-09 00:16:21,297 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-01-09 00:16:21,297 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 492 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:21,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 703 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:16:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62323 states. [2025-01-09 00:16:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62323 to 61463. [2025-01-09 00:16:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61463 states, 61462 states have (on average 1.1162018808369398) internal successors, (68604), 61462 states have internal predecessors, (68604), 0 states have call successors, (0), 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-01-09 00:16:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61463 states to 61463 states and 68604 transitions. [2025-01-09 00:16:22,019 INFO L78 Accepts]: Start accepts. Automaton has 61463 states and 68604 transitions. Word has length 613 [2025-01-09 00:16:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:22,019 INFO L471 AbstractCegarLoop]: Abstraction has 61463 states and 68604 transitions. [2025-01-09 00:16:22,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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-01-09 00:16:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 61463 states and 68604 transitions. [2025-01-09 00:16:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-01-09 00:16:22,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:22,045 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:16:22,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:16:22,045 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:22,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:22,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2066996018, now seen corresponding path program 1 times [2025-01-09 00:16:22,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:22,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760633599] [2025-01-09 00:16:22,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:22,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-01-09 00:16:22,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-01-09 00:16:22,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:22,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-01-09 00:16:22,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:22,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760633599] [2025-01-09 00:16:22,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760633599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:22,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:22,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:22,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998336998] [2025-01-09 00:16:22,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:22,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:22,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:22,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:22,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:22,604 INFO L87 Difference]: Start difference. First operand 61463 states and 68604 transitions. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 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-01-09 00:16:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:24,242 INFO L93 Difference]: Finished difference Result 143827 states and 160388 transitions. [2025-01-09 00:16:24,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:24,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 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-01-09 00:16:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:24,339 INFO L225 Difference]: With dead ends: 143827 [2025-01-09 00:16:24,339 INFO L226 Difference]: Without dead ends: 82366 [2025-01-09 00:16:24,382 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-01-09 00:16:24,383 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 431 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:24,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 616 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:16:24,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82366 states. [2025-01-09 00:16:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82366 to 79346. [2025-01-09 00:16:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79346 states, 79345 states have (on average 1.1147646354527696) internal successors, (88451), 79345 states have internal predecessors, (88451), 0 states have call successors, (0), 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-01-09 00:16:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79346 states to 79346 states and 88451 transitions. [2025-01-09 00:16:25,477 INFO L78 Accepts]: Start accepts. Automaton has 79346 states and 88451 transitions. Word has length 623 [2025-01-09 00:16:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:25,477 INFO L471 AbstractCegarLoop]: Abstraction has 79346 states and 88451 transitions. [2025-01-09 00:16:25,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 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-01-09 00:16:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 79346 states and 88451 transitions. [2025-01-09 00:16:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2025-01-09 00:16:25,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:25,494 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:16:25,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:16:25,494 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:25,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:25,495 INFO L85 PathProgramCache]: Analyzing trace with hash -416597300, now seen corresponding path program 1 times [2025-01-09 00:16:25,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:25,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201639056] [2025-01-09 00:16:25,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:25,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:25,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-01-09 00:16:25,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-01-09 00:16:25,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:25,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 00:16:25,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:25,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201639056] [2025-01-09 00:16:25,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201639056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:25,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:25,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:25,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242725550] [2025-01-09 00:16:25,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:25,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:25,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:25,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:25,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:25,883 INFO L87 Difference]: Start difference. First operand 79346 states and 88451 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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-01-09 00:16:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:27,316 INFO L93 Difference]: Finished difference Result 174444 states and 194294 transitions. [2025-01-09 00:16:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:27,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 624 [2025-01-09 00:16:27,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:27,419 INFO L225 Difference]: With dead ends: 174444 [2025-01-09 00:16:27,419 INFO L226 Difference]: Without dead ends: 92116 [2025-01-09 00:16:27,472 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-01-09 00:16:27,472 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 424 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:27,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 648 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:16:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92116 states. [2025-01-09 00:16:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92116 to 87431. [2025-01-09 00:16:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87431 states, 87430 states have (on average 1.108029280567311) internal successors, (96875), 87430 states have internal predecessors, (96875), 0 states have call successors, (0), 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-01-09 00:16:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87431 states to 87431 states and 96875 transitions. [2025-01-09 00:16:28,589 INFO L78 Accepts]: Start accepts. Automaton has 87431 states and 96875 transitions. Word has length 624 [2025-01-09 00:16:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:28,589 INFO L471 AbstractCegarLoop]: Abstraction has 87431 states and 96875 transitions. [2025-01-09 00:16:28,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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-01-09 00:16:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 87431 states and 96875 transitions. [2025-01-09 00:16:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2025-01-09 00:16:28,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:28,607 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:16:28,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:16:28,607 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:28,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1184366811, now seen corresponding path program 1 times [2025-01-09 00:16:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:28,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677312045] [2025-01-09 00:16:28,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:28,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes. [2025-01-09 00:16:28,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements. [2025-01-09 00:16:28,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:28,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 00:16:29,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:29,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677312045] [2025-01-09 00:16:29,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677312045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:29,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:29,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:16:29,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186220212] [2025-01-09 00:16:29,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:29,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:29,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:29,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:29,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:29,144 INFO L87 Difference]: Start difference. First operand 87431 states and 96875 transitions. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-09 00:16:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:31,556 INFO L93 Difference]: Finished difference Result 203437 states and 225410 transitions. [2025-01-09 00:16:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:31,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 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 628 [2025-01-09 00:16:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:31,683 INFO L225 Difference]: With dead ends: 203437 [2025-01-09 00:16:31,683 INFO L226 Difference]: Without dead ends: 116008 [2025-01-09 00:16:31,712 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-01-09 00:16:31,712 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 827 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:31,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 176 Invalid, 2674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:16:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116008 states. [2025-01-09 00:16:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116008 to 110041. [2025-01-09 00:16:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110041 states, 110040 states have (on average 1.1095692475463468) internal successors, (122097), 110040 states have internal predecessors, (122097), 0 states have call successors, (0), 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-01-09 00:16:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110041 states to 110041 states and 122097 transitions. [2025-01-09 00:16:33,023 INFO L78 Accepts]: Start accepts. Automaton has 110041 states and 122097 transitions. Word has length 628 [2025-01-09 00:16:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:33,023 INFO L471 AbstractCegarLoop]: Abstraction has 110041 states and 122097 transitions. [2025-01-09 00:16:33,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-09 00:16:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 110041 states and 122097 transitions. [2025-01-09 00:16:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-01-09 00:16:33,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:33,041 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:33,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:16:33,041 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:33,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:33,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1032108188, now seen corresponding path program 1 times [2025-01-09 00:16:33,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:33,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259194078] [2025-01-09 00:16:33,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:33,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:33,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-01-09 00:16:33,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-01-09 00:16:33,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:33,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 375 proven. 82 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 00:16:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259194078] [2025-01-09 00:16:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259194078] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114517972] [2025-01-09 00:16:34,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:34,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:34,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:34,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:16:34,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:16:34,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-01-09 00:16:34,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-01-09 00:16:34,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:34,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:34,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 00:16:34,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 375 proven. 82 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 00:16:35,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:16:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 456 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 00:16:35,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114517972] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:16:35,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:16:35,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-01-09 00:16:35,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654204453] [2025-01-09 00:16:35,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:16:35,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:16:35,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:35,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:16:35,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:16:35,917 INFO L87 Difference]: Start difference. First operand 110041 states and 122097 transitions. Second operand has 10 states, 10 states have (on average 89.2) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 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-01-09 00:16:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:40,161 INFO L93 Difference]: Finished difference Result 240388 states and 266411 transitions. [2025-01-09 00:16:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 00:16:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 89.2) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 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 643 [2025-01-09 00:16:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:40,292 INFO L225 Difference]: With dead ends: 240388 [2025-01-09 00:16:40,293 INFO L226 Difference]: Without dead ends: 130349 [2025-01-09 00:16:40,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1281 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:16:40,356 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 2892 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 6606 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2892 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 7371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 6606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:40,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2892 Valid, 440 Invalid, 7371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 6606 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 00:16:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130349 states. [2025-01-09 00:16:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130349 to 116001. [2025-01-09 00:16:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116001 states, 116000 states have (on average 1.105146551724138) internal successors, (128197), 116000 states have internal predecessors, (128197), 0 states have call successors, (0), 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-01-09 00:16:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116001 states to 116001 states and 128197 transitions. [2025-01-09 00:16:41,953 INFO L78 Accepts]: Start accepts. Automaton has 116001 states and 128197 transitions. Word has length 643 [2025-01-09 00:16:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:41,954 INFO L471 AbstractCegarLoop]: Abstraction has 116001 states and 128197 transitions. [2025-01-09 00:16:41,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.2) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 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-01-09 00:16:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 116001 states and 128197 transitions. [2025-01-09 00:16:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-01-09 00:16:41,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:41,977 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:16:41,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:16:42,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:42,177 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:42,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:42,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1665375659, now seen corresponding path program 1 times [2025-01-09 00:16:42,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:42,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55183047] [2025-01-09 00:16:42,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:42,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:42,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-01-09 00:16:42,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-01-09 00:16:42,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:42,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-01-09 00:16:42,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:42,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55183047] [2025-01-09 00:16:42,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55183047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:42,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:42,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:42,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616159757] [2025-01-09 00:16:42,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:42,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:42,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:42,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:42,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:42,733 INFO L87 Difference]: Start difference. First operand 116001 states and 128197 transitions. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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-01-09 00:16:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:44,598 INFO L93 Difference]: Finished difference Result 260504 states and 287689 transitions. [2025-01-09 00:16:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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 703 [2025-01-09 00:16:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:44,772 INFO L225 Difference]: With dead ends: 260504 [2025-01-09 00:16:44,772 INFO L226 Difference]: Without dead ends: 144504 [2025-01-09 00:16:44,852 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-01-09 00:16:44,853 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 420 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:44,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 324 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:16:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144504 states. [2025-01-09 00:16:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144504 to 136828. [2025-01-09 00:16:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136828 states, 136827 states have (on average 1.0910931322034394) internal successors, (149291), 136827 states have internal predecessors, (149291), 0 states have call successors, (0), 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-01-09 00:16:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136828 states to 136828 states and 149291 transitions. [2025-01-09 00:16:46,364 INFO L78 Accepts]: Start accepts. Automaton has 136828 states and 149291 transitions. Word has length 703 [2025-01-09 00:16:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:46,364 INFO L471 AbstractCegarLoop]: Abstraction has 136828 states and 149291 transitions. [2025-01-09 00:16:46,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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-01-09 00:16:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 136828 states and 149291 transitions. [2025-01-09 00:16:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-01-09 00:16:46,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:46,390 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:16:46,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:16:46,390 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:46,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash 305449956, now seen corresponding path program 1 times [2025-01-09 00:16:46,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:46,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103585306] [2025-01-09 00:16:46,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:46,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 00:16:46,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 00:16:46,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:46,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 728 proven. 80 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 00:16:47,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:47,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103585306] [2025-01-09 00:16:47,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103585306] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:47,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159711619] [2025-01-09 00:16:47,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:47,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:47,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:47,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:16:47,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:16:47,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 00:16:47,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 00:16:47,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:47,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:47,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:16:47,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 808 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 00:16:48,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:16:48,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159711619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:48,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:16:48,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 00:16:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376040306] [2025-01-09 00:16:48,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:48,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:48,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:48,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:48,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:16:48,059 INFO L87 Difference]: Start difference. First operand 136828 states and 149291 transitions. Second operand has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 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-01-09 00:16:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:50,076 INFO L93 Difference]: Finished difference Result 276629 states and 301664 transitions. [2025-01-09 00:16:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 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 729 [2025-01-09 00:16:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:50,218 INFO L225 Difference]: With dead ends: 276629 [2025-01-09 00:16:50,218 INFO L226 Difference]: Without dead ends: 139803 [2025-01-09 00:16:50,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:16:50,287 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 831 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:50,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 295 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:16:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139803 states. [2025-01-09 00:16:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139803 to 139378. [2025-01-09 00:16:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139378 states, 139377 states have (on average 1.0895556655689245) internal successors, (151859), 139377 states have internal predecessors, (151859), 0 states have call successors, (0), 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-01-09 00:16:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139378 states to 139378 states and 151859 transitions. [2025-01-09 00:16:51,716 INFO L78 Accepts]: Start accepts. Automaton has 139378 states and 151859 transitions. Word has length 729 [2025-01-09 00:16:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:51,717 INFO L471 AbstractCegarLoop]: Abstraction has 139378 states and 151859 transitions. [2025-01-09 00:16:51,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 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-01-09 00:16:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 139378 states and 151859 transitions. [2025-01-09 00:16:51,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2025-01-09 00:16:51,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:51,957 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:16:51,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:16:52,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 00:16:52,158 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:52,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:52,159 INFO L85 PathProgramCache]: Analyzing trace with hash -538204366, now seen corresponding path program 1 times [2025-01-09 00:16:52,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:52,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600760930] [2025-01-09 00:16:52,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:52,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:52,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes. [2025-01-09 00:16:52,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements. [2025-01-09 00:16:52,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:52,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:16:52,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 00:16:52,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes. [2025-01-09 00:16:52,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements. [2025-01-09 00:16:52,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:52,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:16:52,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 00:16:52,528 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 00:16:52,529 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:16:52,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:16:52,534 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] [2025-01-09 00:16:52,709 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:16:52,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:16:52 BoogieIcfgContainer [2025-01-09 00:16:52,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:16:52,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:16:52,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:16:52,716 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:16:52,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:43" (3/4) ... [2025-01-09 00:16:52,717 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 00:16:53,015 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 821. [2025-01-09 00:16:53,192 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:16:53,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:16:53,194 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:16:53,195 INFO L158 Benchmark]: Toolchain (without parser) took 74329.35ms. Allocated memory was 167.8MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 125.0MB in the beginning and 6.6GB in the end (delta: -6.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-01-09 00:16:53,195 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:16:53,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 812.80ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 92.5MB in the end (delta: 32.5MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. [2025-01-09 00:16:53,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 208.69ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 82.8MB in the end (delta: 9.7MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2025-01-09 00:16:53,196 INFO L158 Benchmark]: Boogie Preprocessor took 332.29ms. Allocated memory is still 167.8MB. Free memory was 82.8MB in the beginning and 53.6MB in the end (delta: 29.2MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2025-01-09 00:16:53,196 INFO L158 Benchmark]: RCFGBuilder took 2857.56ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 53.6MB in the beginning and 79.3MB in the end (delta: -25.7MB). Peak memory consumption was 156.4MB. Max. memory is 16.1GB. [2025-01-09 00:16:53,196 INFO L158 Benchmark]: TraceAbstraction took 69631.00ms. Allocated memory was 335.5MB in the beginning and 6.5GB in the end (delta: 6.2GB). Free memory was 79.3MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-01-09 00:16:53,197 INFO L158 Benchmark]: Witness Printer took 477.67ms. Allocated memory was 6.5GB in the beginning and 8.4GB in the end (delta: 1.9GB). Free memory was 4.4GB in the beginning and 6.6GB in the end (delta: -2.1GB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2025-01-09 00:16:53,198 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.22ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 812.80ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 92.5MB in the end (delta: 32.5MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 208.69ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 82.8MB in the end (delta: 9.7MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 332.29ms. Allocated memory is still 167.8MB. Free memory was 82.8MB in the beginning and 53.6MB in the end (delta: 29.2MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2857.56ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 53.6MB in the beginning and 79.3MB in the end (delta: -25.7MB). Peak memory consumption was 156.4MB. Max. memory is 16.1GB. * TraceAbstraction took 69631.00ms. Allocated memory was 335.5MB in the beginning and 6.5GB in the end (delta: 6.2GB). Free memory was 79.3MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 477.67ms. Allocated memory was 6.5GB in the beginning and 8.4GB in the end (delta: 1.9GB). Free memory was 4.4GB in the beginning and 6.6GB in the end (delta: -2.1GB). Peak memory consumption was 113.2MB. 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: 57]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int inputA = 1; [L19] int inputB = 2; [L20] int inputC = 3; [L21] int inputE = 5; [L22] int inputD = 4; [L23] int inputF = 6; [L26] int a24 = 1; [L27] int a21 = 124; [L28] int a26 = 222; [L29] int a14 = -79; [L30] int a28 = 111; VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2587] int output = -1; VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-79, a21=124, a24=1, a26=222, a28=111, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND TRUE ( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 )) [L334] a14 = ((((a14 % 299909)- 300090) + 0) + -1) [L335] a26 = ((((a26 * 9)/ 10) - 554854) * 1) [L336] a28 = ((((a28 * 9)/ 10) * 1) - 589002) [L337] a24 = 2 [L339] return 25; VAL [\result=25, a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(( a21 <= 127 && ((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && (input == 3)) && a21 <= 127 ) && (a24==3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((a24==2) && ( 217 < a26 && (((input == 4) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(( a21 <= 127 && ((( ((-114 < a14) && (-84 >= a14)) && ( ((124 < a26) && (217 >= a26)) && (input == 2))) && (a24==3)) && a28 <= 37 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==3)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a24==3) && ( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a14 <= -182 ) && 217 < a26 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND FALSE !(( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 6) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a21 <= 127 ) && (a24==2))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L568] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ((((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && a26 <= -68 ) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !((((a24==2) && (((input == 2) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 )) || ( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ))) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L580] COND FALSE !((((( -84 < a14 && ((input == 2) && a21 <= 127 )) && a26 <= -68 ) && (a24==2)) && ((37 < a28) && (134 >= a28)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)) && ((-182 < a14) && (-114 >= a14)) ))) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (((input == 3) && ((-68 < a26) && (124 >= a26)) ) && 300 < a28 ))) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && (((a24==2) && (input == 1)) && ((124 < a26) && (217 >= a26)) ))) && -84 < a14 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(((((a24==2) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L609] COND FALSE !((((((a24==2) && ( ((134 < a28) && (300 >= a28)) && (input == 2))) && 217 < a26 ) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !(( a28 <= 37 && (( 217 < a26 && ((a24==3) && ((input == 3) && a14 <= -182 ))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(( a21 <= 127 && (((a24==3) && (((input == 4) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 )) && a26 <= -68 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ( a14 <= -182 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6)) && a14 <= -182 ))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L650] COND FALSE !(((((((a24==3) && (input == 5)) && 217 < a26 ) && a28 <= 37 ) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 2)) && (a24==3))) && ((-68 < a26) && (124 >= a26)) ) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(( 217 < a26 && (((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 4)) && a21 <= 127 ) && (a24==2)) && ((-114 < a14) && (-84 >= a14)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((((a24==3) && ( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L677] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 5))) && a26 <= -68 ) && a21 <= 127 ) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L683] COND FALSE !(((((a24==2) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5))) && a21 <= 127 ) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L689] COND FALSE !(( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && ((( 217 < a26 && (input == 3)) && a14 <= -182 ) && (a24==2))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L696] COND FALSE !(((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && ( -84 < a14 && (input == 2)))) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L708] COND FALSE !(((a24==3) && (( ((124 < a26) && (217 >= a26)) && ( -84 < a14 && ( 300 < a28 && (input == 3)))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L713] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 3)) && a26 <= -68 ) && (a24==2)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L719] COND FALSE !(((a24==2) && ( a21 <= 127 && (((input == 5) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( 300 < a28 && ((-182 < a14) && (-114 >= a14)) )) || ( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 ))) && ((-68 < a26) && (124 >= a26)) )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L729] COND FALSE !(( a21 <= 127 && (( ((-114 < a14) && (-84 >= a14)) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && a26 <= -68 )) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !((( a21 <= 127 && ((( 300 < a28 && ( -84 < a14 && ((-68 < a26) && (124 >= a26)) )) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 5))) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L747] COND FALSE !(((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && ( a28 <= 37 && (((input == 5) && a21 <= 127 ) && ((124 < a26) && (217 >= a26)) ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !(( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ((a24==2) && (((input == 3) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((((a24==3) && (((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(((a24==2) && (( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && ((input == 4) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !(( a26 <= -68 && ( a21 <= 127 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 2)))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L786] COND FALSE !((((( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 6))) && -84 < a14 ) && (a24==2)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L791] COND FALSE !((((( -84 < a14 && ( a21 <= 127 && (input == 3))) && a26 <= -68 ) && 300 < a28 ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !(((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ( a21 <= 127 && ((( -84 < a14 && ((37 < a28) && (134 >= a28)) ) || (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 ))) && (input == 1)))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( ((37 < a28) && (134 >= a28)) && ((((input == 5) && a21 <= 127 ) && (a24==2)) && -84 < a14 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L810] COND FALSE !((((a24==3) && ((((input == 4) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && ((-68 < a26) && (124 >= a26)) ) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !(((((((input == 6) && -84 < a14 ) && a26 <= -68 ) && (a24==3)) && a21 <= 127 ) && 300 < a28 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && (((input == 4) && a28 <= 37 ) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L830] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ((( a26 <= -68 && ((input == 5) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && (a24==3)) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L836] COND FALSE !(((((a24==2) && ((input == 6) && (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 ) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( a21 <= 127 && ( a26 <= -68 && ((a24==3) && ( -84 < a14 && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 6))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((( a14 <= -182 && (( ((37 < a28) && (134 >= a28)) && ((input == 5) && (a24==2))) && 217 < a26 )) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L857] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 5)) && 217 < a26 ))) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !((( a21 <= 127 && ( a14 <= -182 && (( ((134 < a28) && (300 >= a28)) && (input == 3)) && (a24==2)))) && 217 < a26 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((a24==2) && ( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (input == 4)))) && -84 < a14 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L881] COND FALSE !(((((a24==3) && ( ((124 < a26) && (217 >= a26)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a21 <= 127 && (( a14 <= -182 && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !((( a21 <= 127 && (( ((-182 < a14) && (-114 >= a14)) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 1))) && ((124 < a26) && (217 >= a26)) )) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L894] COND FALSE !(((( ((-68 < a26) && (124 >= a26)) && ( ((-182 < a14) && (-114 >= a14)) && ((input == 5) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==3)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L901] COND FALSE !(( a21 <= 127 && (((((input == 4) && a26 <= -68 ) && (a24==3)) && -84 < a14 ) && 300 < a28 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L908] COND FALSE !(((a24==2) && (( ((-182 < a14) && (-114 >= a14)) && ( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L919] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ((((input == 4) && a21 <= 127 ) && a14 <= -182 ) && (a24==3))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L923] COND FALSE !((( -84 < a14 && ( a21 <= 127 && ( a28 <= 37 && ((input == 1) && ((-68 < a26) && (124 >= a26)) )))) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( a21 <= 127 && ( a28 <= 37 && ((( ((-114 < a14) && (-84 >= a14)) && (input == 4)) && ((124 < a26) && (217 >= a26)) ) && (a24==3))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !(((( a28 <= 37 && (( a21 <= 127 && (input == 5)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) ) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2)) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L949] COND FALSE !((( a21 <= 127 && ((( a28 <= 37 && (input == 2)) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L956] COND FALSE !((( a26 <= -68 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) )) && (input == 3)))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L962] COND FALSE !(( a21 <= 127 && ((input == 6) && ((( ((134 < a28) && (300 >= a28)) && ((a24==2) && ( -84 < a14 && 217 < a26 ))) || ( 300 < a28 && ((a24==2) && ( 217 < a26 && -84 < a14 )))) || (((a24==3) && ( a26 <= -68 && a14 <= -182 )) && a28 <= 37 ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( 217 < a26 && ((((a24==3) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 4))) && a14 <= -182 ) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !(((((((input == 3) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && a26 <= -68 ) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=-588903, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L982] COND TRUE ( a14 <= -182 && ((((a24==2) && ((input == 2) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a26 <= -68 ) && a21 <= 127 )) [L983] a28 = ((((a28 % 299849)- -300149) - 506398) - -506401) [L984] return 26; VAL [\result=26, a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(( a21 <= 127 && ((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && (input == 3)) && a21 <= 127 ) && (a24==3)))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((a24==2) && ( 217 < a26 && (((input == 4) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 )))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(( a21 <= 127 && ((( ((-114 < a14) && (-84 >= a14)) && ( ((124 < a26) && (217 >= a26)) && (input == 2))) && (a24==3)) && a28 <= 37 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==3)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a24==3) && ( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a14 <= -182 ) && 217 < a26 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND FALSE !(( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 6) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a21 <= 127 ) && (a24==2))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L568] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ((((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && a26 <= -68 ) && a21 <= 127 ))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !((((a24==2) && (((input == 2) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 )) || ( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ))) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L580] COND FALSE !((((( -84 < a14 && ((input == 2) && a21 <= 127 )) && a26 <= -68 ) && (a24==2)) && ((37 < a28) && (134 >= a28)) )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)) && ((-182 < a14) && (-114 >= a14)) ))) && a26 <= -68 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (((input == 3) && ((-68 < a26) && (124 >= a26)) ) && 300 < a28 ))) && (a24==2))) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && (((a24==2) && (input == 1)) && ((124 < a26) && (217 >= a26)) ))) && -84 < a14 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND TRUE ((((a24==2) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )))) && a26 <= -68 ) && a21 <= 127 ) [L605] a14 = (((((a14 - -113223) + -74409) * 1) % 299909)+ -300090) [L606] a26 = ((((a26 % 95)+ 39) + 32) - 25) [L607] a28 = (((((a28 * 9)/ 10) * 1) % 300018)+ -299980) [L608] return 21; VAL [\result=21, a14=-561446, a21=124, a24=2, a26=1, a28=-289992, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=1, a28=-289992, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND TRUE ( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 ))) [L273] a26 = (((a26 - -478961) + -415672) + 258271) [L274] a28 = ((((a28 % 299849)- -300149) + 2) * 1) [L275] return 26; VAL [\result=26, a14=-561446, a21=124, a24=2, a26=321561, a28=10159, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L206] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L209] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L219] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L232] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L248] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L253] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L266] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L272] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L276] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !(( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( ((-114 < a14) && (-84 >= a14)) && ((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 6) && ((-182 < a14) && (-114 >= a14)) )) && 300 < a28 ) && (a24==3)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L352] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 2)) && (a24==3)) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (input == 3)) && a28 <= 37 )) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(( a21 <= 127 && (((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a14 <= -182 )) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((( a21 <= 127 && ((((a24==2) && (input == 5)) && ((134 < a28) && (300 >= a28)) ) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !(((((( 217 < a26 && (input == 2)) && a28 <= 37 ) && a21 <= 127 ) && (a24==3)) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 3) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && (a24==3))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L395] COND FALSE !(( ((134 < a28) && (300 >= a28)) && ((( a21 <= 127 && ((a24==2) && (input == 6))) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L402] COND FALSE !((( a21 <= 127 && ((a24==3) && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))))) && -84 < a14 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L409] COND FALSE !((( a14 <= -182 && ((a24==2) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5))))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L415] COND FALSE !(( a21 <= 127 && ((( ((124 < a26) && (217 >= a26)) && ((input == 6) && -84 < a14 )) && (a24==3)) && 300 < a28 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L426] COND FALSE !(( a21 <= 127 && ((a24==3) && ( a26 <= -68 && (((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L433] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (((input == 3) && (a24==3)) && a21 <= 127 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L438] COND FALSE !(( a21 <= 127 && ((a24==2) && ( -84 < a14 && ( a26 <= -68 && ((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !((((a24==2) && ( a21 <= 127 && ((input == 5) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && a26 <= -68 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L449] COND FALSE !(((a24==3) && (( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)))) && (a24==2)) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L461] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((input == 3) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L468] COND FALSE !(((a24==2) && (( ((-114 < a14) && (-84 >= a14)) && ( a26 <= -68 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 4)))) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(( a14 <= -182 && (( a26 <= -68 && ((a24==3) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !(( a21 <= 127 && ((((( a14 <= -182 && a26 <= -68 ) && (a24==3)) && a28 <= 37 ) || ((((a24==2) && ( -84 < a14 && 217 < a26 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 ))) && (input == 3)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L485] COND FALSE !(((((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && 217 < a26 ) && (a24==3)) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a24==2) && ( -84 < a14 && ( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 4))))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L496] COND FALSE !((((( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && (a24==2)) && a21 <= 127 ) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(( a21 <= 127 && ((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && (input == 3)) && a21 <= 127 ) && (a24==3)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L512] COND FALSE !(((a24==2) && ( 217 < a26 && (((input == 4) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(( a21 <= 127 && ((( ((-114 < a14) && (-84 >= a14)) && ( ((124 < a26) && (217 >= a26)) && (input == 2))) && (a24==3)) && a28 <= 37 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==3)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a24==3) && ( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a14 <= -182 ) && 217 < a26 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND FALSE !(( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 6) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a21 <= 127 ) && (a24==2))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L568] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ((((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && a26 <= -68 ) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !((((a24==2) && (((input == 2) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 )) || ( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ))) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L580] COND FALSE !((((( -84 < a14 && ((input == 2) && a21 <= 127 )) && a26 <= -68 ) && (a24==2)) && ((37 < a28) && (134 >= a28)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( a21 <= 127 && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)) && ((-182 < a14) && (-114 >= a14)) ))) && a26 <= -68 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (((input == 3) && ((-68 < a26) && (124 >= a26)) ) && 300 < a28 ))) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L597] COND FALSE !((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && (((a24==2) && (input == 1)) && ((124 < a26) && (217 >= a26)) ))) && -84 < a14 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L604] COND FALSE !(((((a24==2) && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )))) && a26 <= -68 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L609] COND FALSE !((((((a24==2) && ( ((134 < a28) && (300 >= a28)) && (input == 2))) && 217 < a26 ) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L616] COND FALSE !(( a28 <= 37 && (( 217 < a26 && ((a24==3) && ((input == 3) && a14 <= -182 ))) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(( a21 <= 127 && (((a24==3) && (((input == 4) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a14 <= -182 )) && a26 <= -68 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ( a14 <= -182 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L644] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6)) && a14 <= -182 ))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L650] COND FALSE !(((((((a24==3) && (input == 5)) && 217 < a26 ) && a28 <= 37 ) && a14 <= -182 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 2)) && (a24==3))) && ((-68 < a26) && (124 >= a26)) ) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(( 217 < a26 && (((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 4)) && a21 <= 127 ) && (a24==2)) && ((-114 < a14) && (-84 >= a14)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((((a24==3) && ( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2))))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L677] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 5))) && a26 <= -68 ) && a21 <= 127 ) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L683] COND FALSE !(((((a24==2) && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 5))) && a21 <= 127 ) && a26 <= -68 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L689] COND FALSE !(( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && ((( 217 < a26 && (input == 3)) && a14 <= -182 ) && (a24==2))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L696] COND FALSE !(((( ((134 < a28) && (300 >= a28)) && ( a21 <= 127 && ( -84 < a14 && (input == 2)))) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L708] COND FALSE !(((a24==3) && (( ((124 < a26) && (217 >= a26)) && ( -84 < a14 && ( 300 < a28 && (input == 3)))) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L713] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 3)) && a26 <= -68 ) && (a24==2)) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L719] COND FALSE !(((a24==2) && ( a21 <= 127 && (((input == 5) && ((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( 300 < a28 && ((-182 < a14) && (-114 >= a14)) )) || ( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 ))) && ((-68 < a26) && (124 >= a26)) )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L729] COND FALSE !(( a21 <= 127 && (( ((-114 < a14) && (-84 >= a14)) && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && a26 <= -68 )) && (a24==2)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L735] COND FALSE !((( a21 <= 127 && ((( 300 < a28 && ( -84 < a14 && ((-68 < a26) && (124 >= a26)) )) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 5))) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L747] COND FALSE !(((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && ( a28 <= 37 && (((input == 5) && a21 <= 127 ) && ((124 < a26) && (217 >= a26)) ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L752] COND FALSE !(( a21 <= 127 && ( ((124 < a26) && (217 >= a26)) && ((a24==2) && (((input == 3) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L758] COND FALSE !(((((a24==3) && (((input == 2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L771] COND FALSE !(((a24==2) && (( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && ((input == 4) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !(( a26 <= -68 && ( a21 <= 127 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 2)))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L786] COND FALSE !((((( ((37 < a28) && (134 >= a28)) && ( ((-68 < a26) && (124 >= a26)) && (input == 6))) && -84 < a14 ) && (a24==2)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L791] COND FALSE !((((( -84 < a14 && ( a21 <= 127 && (input == 3))) && a26 <= -68 ) && 300 < a28 ) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !(((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ( a21 <= 127 && ((( -84 < a14 && ((37 < a28) && (134 >= a28)) ) || (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 ))) && (input == 1)))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L803] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( ((37 < a28) && (134 >= a28)) && ((((input == 5) && a21 <= 127 ) && (a24==2)) && -84 < a14 )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L810] COND FALSE !((((a24==3) && ((((input == 4) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && ((-68 < a26) && (124 >= a26)) ) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !(((((((input == 6) && -84 < a14 ) && a26 <= -68 ) && (a24==3)) && a21 <= 127 ) && 300 < a28 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((124 < a26) && (217 >= a26)) && (((input == 4) && a28 <= 37 ) && ((-182 < a14) && (-114 >= a14)) ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L830] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ((( a26 <= -68 && ((input == 5) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && (a24==3)) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L836] COND FALSE !(((((a24==2) && ((input == 6) && (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 )))) && a21 <= 127 ) && a26 <= -68 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( a21 <= 127 && ( a26 <= -68 && ((a24==3) && ( -84 < a14 && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 6))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((( a14 <= -182 && (( ((37 < a28) && (134 >= a28)) && ((input == 5) && (a24==2))) && 217 < a26 )) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L857] COND FALSE !((((a24==2) && ( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 5)) && 217 < a26 ))) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !((( a21 <= 127 && ( a14 <= -182 && (( ((134 < a28) && (300 >= a28)) && (input == 3)) && (a24==2)))) && 217 < a26 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((a24==2) && ( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (input == 4)))) && -84 < a14 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L881] COND FALSE !(((((a24==3) && ( ((124 < a26) && (217 >= a26)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L884] COND FALSE !(( a21 <= 127 && (( a14 <= -182 && ( ((124 < a26) && (217 >= a26)) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && (a24==2)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND FALSE !((( a21 <= 127 && (( ((-182 < a14) && (-114 >= a14)) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 1))) && ((124 < a26) && (217 >= a26)) )) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L894] COND FALSE !(((( ((-68 < a26) && (124 >= a26)) && ( ((-182 < a14) && (-114 >= a14)) && ((input == 5) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==3)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L901] COND FALSE !(( a21 <= 127 && (((((input == 4) && a26 <= -68 ) && (a24==3)) && -84 < a14 ) && 300 < a28 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L908] COND FALSE !(((a24==2) && (( ((-182 < a14) && (-114 >= a14)) && ( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)))) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L919] COND FALSE !(( 217 < a26 && ( a28 <= 37 && ((((input == 4) && a21 <= 127 ) && a14 <= -182 ) && (a24==3))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L923] COND FALSE !((( -84 < a14 && ( a21 <= 127 && ( a28 <= 37 && ((input == 1) && ((-68 < a26) && (124 >= a26)) )))) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L929] COND FALSE !(( a21 <= 127 && ( a28 <= 37 && ((( ((-114 < a14) && (-84 >= a14)) && (input == 4)) && ((124 < a26) && (217 >= a26)) ) && (a24==3))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L940] COND FALSE !(((( a28 <= 37 && (( a21 <= 127 && (input == 5)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) ) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L945] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2)) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L949] COND FALSE !((( a21 <= 127 && ((( a28 <= 37 && (input == 2)) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L956] COND FALSE !((( a26 <= -68 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) )) && (input == 3)))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L962] COND FALSE !(( a21 <= 127 && ((input == 6) && ((( ((134 < a28) && (300 >= a28)) && ((a24==2) && ( -84 < a14 && 217 < a26 ))) || ( 300 < a28 && ((a24==2) && ( 217 < a26 && -84 < a14 )))) || (((a24==3) && ( a26 <= -68 && a14 <= -182 )) && a28 <= 37 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L969] COND FALSE !(( 217 < a26 && ((((a24==3) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 4))) && a14 <= -182 ) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L976] COND FALSE !(((((((input == 3) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && a26 <= -68 ) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) ) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L982] COND FALSE !(( a14 <= -182 && ((((a24==2) && ((input == 2) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && a26 <= -68 ) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L985] COND FALSE !(((( 300 < a28 && (((input == 2) && ((-182 < a14) && (-114 >= a14)) ) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L991] COND FALSE !(((a24==2) && (( a21 <= 127 && ((input == 5) && (( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))))) && 217 < a26 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L998] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && ((((input == 4) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 ) && (a24==3))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1005] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && (( ((124 < a26) && (217 >= a26)) && ((input == 1) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))) && (a24==2))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1009] COND FALSE !((( ((-68 < a26) && (124 >= a26)) && ((((input == 6) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && a21 <= 127 ) && (a24==3))) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1015] COND FALSE !((( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && ((a24==3) && ((input == 1) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1021] COND FALSE !(((a24==2) && ( 217 < a26 && ( a21 <= 127 && ((input == 6) && (( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1026] COND FALSE !((( -84 < a14 && (((a24==3) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 1))) && a21 <= 127 )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1038] COND FALSE !(((( 217 < a26 && (((a24==3) && (input == 2)) && a14 <= -182 )) && a21 <= 127 ) && a28 <= 37 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1044] COND FALSE !(((((a24==3) && ( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 2)))) && ((124 < a26) && (217 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1050] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && (((input == 6) && (a24==2)) && a28 <= 37 )) && -84 < a14 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1054] COND FALSE !(( ((124 < a26) && (217 >= a26)) && ((a24==3) && ( -84 < a14 && (( 300 < a28 && (input == 2)) && a21 <= 127 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1060] COND FALSE !(((( a28 <= 37 && (((a24==3) && (input == 3)) && a26 <= -68 )) && a21 <= 127 ) && -84 < a14 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1066] COND FALSE !((( ((-182 < a14) && (-114 >= a14)) && ((a24==3) && ( a21 <= 127 && ((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1073] COND FALSE !(((((((input == 4) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1079] COND FALSE !(((a24==2) && ( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && (((input == 6) && ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && ((-114 < a14) && (-84 >= a14)) ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1086] COND FALSE !(( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) && (((input == 3) && (a24==2)) && -84 < a14 )) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1091] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && (( ((-68 < a26) && (124 >= a26)) && ( 300 < a28 && ((input == 3) && (a24==3)))) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1098] COND FALSE !(( a21 <= 127 && ( ((37 < a28) && (134 >= a28)) && ((a24==3) && (((input == 1) && 217 < a26 ) && a14 <= -182 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1104] COND FALSE !(((a24==3) && ((( a26 <= -68 && ( -84 < a14 && (input == 1))) && a21 <= 127 ) && 300 < a28 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1110] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (((input == 6) && 217 < a26 ) && a21 <= 127 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1116] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ((a24==2) && ((input == 2) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))))) && a21 <= 127 ) && 217 < a26 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1123] COND FALSE !((((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 3)) && -84 < a14 ) && a21 <= 127 ) && (a24==3)) && a26 <= -68 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1129] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && (((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 1)) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 ) && (a24==3)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1135] COND FALSE !(((( a26 <= -68 && ( ((134 < a28) && (300 >= a28)) && ((input == 1) && a21 <= 127 ))) && (a24==2)) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1140] COND FALSE !(( a14 <= -182 && ( ((134 < a28) && (300 >= a28)) && (( a21 <= 127 && ((input == 1) && 217 < a26 )) && (a24==2))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1145] COND FALSE !(((a24==2) && ( a21 <= 127 && (((input == 2) && (( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))) && 217 < a26 )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1152] COND FALSE !(( -84 < a14 && ((a24==3) && ((((input == 5) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1155] COND FALSE !(((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( a21 <= 127 && ((input == 2) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 ))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1162] COND FALSE !(( a26 <= -68 && ( -84 < a14 && ((a24==3) && ( a21 <= 127 && ((input == 5) && 300 < a28 )))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1169] COND FALSE !(( a21 <= 127 && ((( ((-68 < a26) && (124 >= a26)) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 2))) && (a24==2)) && -84 < a14 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1176] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( ((-182 < a14) && (-114 >= a14)) && ((((input == 4) && 300 < a28 ) && (a24==3)) && a21 <= 127 )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1182] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((a24==2) && ( a14 <= -182 && ( a21 <= 127 && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 1))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1189] COND FALSE !((( a21 <= 127 && ( a26 <= -68 && ((input == 4) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))))) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1194] COND FALSE !((( a21 <= 127 && (((a24==3) && ((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && ((-182 < a14) && (-114 >= a14)) )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1207] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ( a21 <= 127 && (input == 6))) && (a24==2)) && a28 <= 37 ) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1212] COND FALSE !((( ((-68 < a26) && (124 >= a26)) && ( a21 <= 127 && ((a24==3) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 1))))) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1219] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ( 300 < a28 && ( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ((a24==2) && (input == 5))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1226] COND FALSE !(((a24==2) && ( ((124 < a26) && (217 >= a26)) && ( a14 <= -182 && ((( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 2)) && a21 <= 127 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1230] COND FALSE !(( a26 <= -68 && ((a24==2) && ((((input == 4) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && a21 <= 127 ) && -84 < a14 )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1241] COND FALSE !((( a26 <= -68 && ((a24==3) && ( a21 <= 127 && ( a28 <= 37 && (input == 6))))) && -84 < a14 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1247] COND FALSE !(( a21 <= 127 && ((input == 5) && (( a28 <= 37 && ((a24==3) && ( a26 <= -68 && a14 <= -182 ))) || (( ((134 < a28) && (300 >= a28)) && ((a24==2) && ( 217 < a26 && -84 < a14 ))) || (((a24==2) && ( -84 < a14 && 217 < a26 )) && 300 < a28 )))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1254] COND FALSE !((( a21 <= 127 && ((a24==2) && (((( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) )) && (input == 3)))) && 217 < a26 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1259] COND FALSE !(((( a28 <= 37 && ( a21 <= 127 && ((a24==2) && (input == 2)))) && ((-68 < a26) && (124 >= a26)) ) && -84 < a14 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1265] COND FALSE !(((a24==2) && (((((( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( 300 < a28 && ((-182 < a14) && (-114 >= a14)) )) || ( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 )) && (input == 1)) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1272] COND FALSE !((( ((-182 < a14) && (-114 >= a14)) && (((a24==2) && ((input == 5) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ))) && 217 < a26 )) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1277] COND FALSE !(( a14 <= -182 && ( a21 <= 127 && ((a24==2) && (((input == 5) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && a26 <= -68 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1282] COND FALSE !(((a24==3) && (( ((124 < a26) && (217 >= a26)) && ( a21 <= 127 && ((input == 1) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))))) && a14 <= -182 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1289] COND FALSE !((( ((-68 < a26) && (124 >= a26)) && ((a24==2) && (( a21 <= 127 && (input == 3)) && ((37 < a28) && (134 >= a28)) ))) && -84 < a14 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1294] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && ( ((-68 < a26) && (124 >= a26)) && ((((input == 5) && a21 <= 127 ) && 300 < a28 ) && (a24==3))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1301] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (((((input == 1) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && 300 < a28 ) && (a24==3)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1307] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && (( a21 <= 127 && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 5)) && (a24==2))) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1313] COND FALSE !(((((a24==3) && ( a14 <= -182 && ((input == 1) && a28 <= 37 ))) && 217 < a26 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1316] COND FALSE !(( a21 <= 127 && (( ((-68 < a26) && (124 >= a26)) && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 ))) && (input == 6))) && (a24==3)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1323] COND FALSE !(((((a24==2) && ( -84 < a14 && ( ((-68 < a26) && (124 >= a26)) && (input == 1)))) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1327] COND FALSE !((((( ((134 < a28) && (300 >= a28)) && ((input == 5) && a14 <= -182 )) && (a24==2)) && a21 <= 127 ) && a26 <= -68 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1332] COND FALSE !(( 300 < a28 && (((((a24==3) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ) && a21 <= 127 ) && a26 <= -68 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1338] COND FALSE !(( a21 <= 127 && (((a24==2) && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 1)) && ((-182 < a14) && (-114 >= a14)) )) && a26 <= -68 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1349] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && (( -84 < a14 && (((input == 3) && (a24==3)) && a21 <= 127 )) && ((134 < a28) && (300 >= a28)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1356] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 5)) && a21 <= 127 ) && ((-68 < a26) && (124 >= a26)) )) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1362] COND FALSE !(((a24==3) && (( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 4)))) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1369] COND FALSE !(( a21 <= 127 && ((((input == 1) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 ))) && a26 <= -68 ) && (a24==2)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1374] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 3) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )) && a21 <= 127 ) && ((124 < a26) && (217 >= a26)) )) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1387] COND FALSE !((((a24==3) && (( ((124 < a26) && (217 >= a26)) && (( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 3))) && a21 <= 127 )) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1393] COND FALSE !(( a26 <= -68 && ((((a24==3) && ((input == 2) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )))) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1399] COND FALSE !(((a24==3) && (( a26 <= -68 && (( -84 < a14 && (input == 2)) && a21 <= 127 )) && 300 < a28 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1405] COND FALSE !(( 217 < a26 && ( a21 <= 127 && ((a24==3) && ( a28 <= 37 && ( ((-182 < a14) && (-114 >= a14)) && (input == 5))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1416] COND FALSE !(((a24==2) && (( ((-68 < a26) && (124 >= a26)) && ((( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 ) || (( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 ))) && (input == 4))) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1423] COND FALSE !((( 217 < a26 && ((a24==3) && (((input == 5) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 ))) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1434] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((((input == 1) && ( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) ))) && 217 < a26 ) && a21 <= 127 )) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1438] COND FALSE !(( a21 <= 127 && (((((input == 4) && -84 < a14 ) && ((124 < a26) && (217 >= a26)) ) && (a24==3)) && 300 < a28 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1450] COND FALSE !(((a24==2) && ( ((37 < a28) && (134 >= a28)) && ((((input == 6) && -84 < a14 ) && a26 <= -68 ) && a21 <= 127 )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1454] COND FALSE !(((((( 300 < a28 && (input == 4)) && a21 <= 127 ) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1461] COND FALSE !((((((input == 2) && (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && a26 <= -68 ) && (a24==2)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1467] COND FALSE !((( ((-68 < a26) && (124 >= a26)) && ((((input == 2) && -84 < a14 ) && (a24==2)) && a21 <= 127 )) && ((37 < a28) && (134 >= a28)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1472] COND FALSE !(((((a24==2) && ( ((-182 < a14) && (-114 >= a14)) && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)))) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1477] COND FALSE !(( ((124 < a26) && (217 >= a26)) && ((a24==2) && ( a21 <= 127 && (((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) )) && (input == 6)))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1484] COND FALSE !((((a24==2) && (( a21 <= 127 && ((input == 1) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))) && -84 < a14 )) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1491] COND FALSE !((((a24==3) && (((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1)) && a26 <= -68 ) && ((-114 < a14) && (-84 >= a14)) )) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1497] COND FALSE !(((a24==2) && (((( a21 <= 127 && (input == 2)) && 217 < a26 ) && ((37 < a28) && (134 >= a28)) ) && a14 <= -182 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1500] COND FALSE !(( a21 <= 127 && ((a24==2) && ( ((-68 < a26) && (124 >= a26)) && ((( ((-114 < a14) && (-84 >= a14)) && a28 <= 37 ) || (( ((134 < a28) && (300 >= a28)) && ((-182 < a14) && (-114 >= a14)) ) || ( 300 < a28 && ((-182 < a14) && (-114 >= a14)) ))) && (input == 6)))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1507] COND FALSE !((( 217 < a26 && ((((( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( a28 <= 37 && -84 < a14 )) || ( ((37 < a28) && (134 >= a28)) && -84 < a14 )) && (input == 6)) && a21 <= 127 )) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1514] COND FALSE !(( a14 <= -182 && ( a21 <= 127 && (((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 3)) && ((-68 < a26) && (124 >= a26)) ) && (a24==2))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1520] COND FALSE !(((( a21 <= 127 && ((( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 5)) && a26 <= -68 )) && (a24==2)) && -84 < a14 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1525] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && (( a26 <= -68 && ((input == 2) && 300 < a28 )) && (a24==3))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1531] COND FALSE !(( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( ((124 < a26) && (217 >= a26)) && ((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==2))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1535] COND FALSE !((( a26 <= -68 && ( -84 < a14 && ((( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 2)) && a21 <= 127 ))) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1541] COND FALSE !((((a24==2) && ((((input == 1) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && a21 <= 127 ) && 217 < a26 )) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1548] COND FALSE !(((a24==2) && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))) && ((-182 < a14) && (-114 >= a14)) )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1555] COND FALSE !(((( a14 <= -182 && ( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && (input == 1)))) && 217 < a26 ) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1561] COND FALSE !(((((( a21 <= 127 && (input == 6)) && a26 <= -68 ) && (a24==2)) && a14 <= -182 ) && ((134 < a28) && (300 >= a28)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1566] COND FALSE !((( a21 <= 127 && (( ((-114 < a14) && (-84 >= a14)) && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 6))) && ((-68 < a26) && (124 >= a26)) )) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1573] COND FALSE !(((((( a21 <= 127 && (input == 2)) && a14 <= -182 ) && (a24==3)) && ((37 < a28) && (134 >= a28)) ) && 217 < a26 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1580] COND FALSE !(((((((input == 2) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && a14 <= -182 ) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1584] COND FALSE !(( a14 <= -182 && ((a24==2) && ( 217 < a26 && ( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && (input == 6))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1592] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 1)) && ((-114 < a14) && (-84 >= a14)) ) && (a24==2))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1597] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (((a24==2) && ( a14 <= -182 && ((input == 4) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1600] COND FALSE !(( a21 <= 127 && ((( a14 <= -182 && ((input == 4) && a28 <= 37 )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1605] COND FALSE !(((a24==3) && ( a21 <= 127 && ( -84 < a14 && (((input == 3) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((124 < a26) && (217 >= a26)) ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1618] COND FALSE !(( ((124 < a26) && (217 >= a26)) && ((a24==3) && (( a28 <= 37 && ((input == 1) && a21 <= 127 )) && ((-114 < a14) && (-84 >= a14)) )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1623] COND FALSE !((( a26 <= -68 && ( a21 <= 127 && (( 300 < a28 && (input == 4)) && (a24==3)))) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1630] COND FALSE !((((a24==2) && (( 217 < a26 && ((input == 4) && a21 <= 127 )) && ((134 < a28) && (300 >= a28)) )) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1636] COND FALSE !((( a21 <= 127 && ((((input == 3) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) )) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1642] COND FALSE !(( a21 <= 127 && ( a26 <= -68 && (((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 3)) && (a24==2)) && a14 <= -182 )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1646] COND FALSE !(( a21 <= 127 && ((a24==2) && (((( 300 < a28 && a14 <= -182 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) )) && (input == 1)) && 217 < a26 )))) [L1653] CALL, EXPR calculate_output2(input) [L1659] COND FALSE !(( a21 <= 127 && ((( -84 < a14 && ((input == 3) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && (a24==1)) && 217 < a26 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1664] COND FALSE !(((( ((124 < a26) && (217 >= a26)) && ((input == 5) && (( -84 < a14 && ((37 < a28) && (134 >= a28)) ) || (( ((-114 < a14) && (-84 >= a14)) && 300 < a28 ) || ( -84 < a14 && a28 <= 37 ))))) && a21 <= 127 ) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1669] COND FALSE !((( -84 < a14 && (((( ((134 < a28) && (300 >= a28)) || 300 < a28 ) && (input == 5)) && (a24==2)) && a21 <= 127 )) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1673] COND FALSE !(( ((-182 < a14) && (-114 >= a14)) && (( ((124 < a26) && (217 >= a26)) && ((a24==3) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )))) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1680] COND FALSE !((((a24==3) && ((input == 4) && (( 300 < a28 && ( -84 < a14 && ((-68 < a26) && (124 >= a26)) )) || ( a28 <= 37 && ( ((124 < a26) && (217 >= a26)) && a14 <= -182 ))))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1687] COND FALSE !(( a21 <= 127 && ((a24==2) && ((input == 3) && (( 300 < a28 && ( ((124 < a26) && (217 >= a26)) && -84 < a14 )) || ( a28 <= 37 && ( a14 <= -182 && 217 < a26 ))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1692] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 1)) && (a24==3)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1704] COND FALSE !((( a21 <= 127 && (((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 3)) && (a24==2)) && ((-114 < a14) && (-84 >= a14)) )) && a26 <= -68 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1710] COND FALSE !((((( 217 < a26 && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4))) && ((-182 < a14) && (-114 >= a14)) ) && (a24==2)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1717] COND FALSE !(( -84 < a14 && ((a24==3) && ( a21 <= 127 && ( ((-68 < a26) && (124 >= a26)) && ( ((134 < a28) && (300 >= a28)) && (input == 1))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1728] COND FALSE !((((a24==2) && ( a26 <= -68 && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4))))) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1733] COND FALSE !((( a14 <= -182 && ( a26 <= -68 && ((a24==3) && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6))))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1740] COND FALSE !((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ( a26 <= -68 && ((input == 1) && a21 <= 127 )))) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1745] COND FALSE !(((((a24==3) && ( a14 <= -182 && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 2)))) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1751] COND FALSE !(( a21 <= 127 && (( a14 <= -182 && ((a24==2) && ( ((134 < a28) && (300 >= a28)) && (input == 6)))) && 217 < a26 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1755] COND FALSE !((( -84 < a14 && ( ((134 < a28) && (300 >= a28)) && (((input == 2) && (a24==2)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1759] COND FALSE !(( a14 <= -182 && ((a24==3) && (( ((124 < a26) && (217 >= a26)) && ((input == 3) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && a21 <= 127 )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1766] COND FALSE !(((((input == 6) && ((( ((124 < a26) && (217 >= a26)) && -84 < a14 ) && 300 < a28 ) || ( a28 <= 37 && ( a14 <= -182 && 217 < a26 )))) && a21 <= 127 ) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1773] COND FALSE !((((a24==3) && ( a28 <= 37 && ( a21 <= 127 && ( a26 <= -68 && (input == 5))))) && -84 < a14 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1780] COND FALSE !(( a21 <= 127 && ( 217 < a26 && (((input == 1) && (( -84 < a14 && ((37 < a28) && (134 >= a28)) ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )))) && (a24==2))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1787] COND FALSE !(((( a21 <= 127 && ( a26 <= -68 && (( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 6)))) && ((-182 < a14) && (-114 >= a14)) ) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1794] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && ( a21 <= 127 && ((a24==3) && (((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 6)) && a26 <= -68 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1801] COND FALSE !((((a24==3) && ( -84 < a14 && ((( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1811] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ((a24==2) && ( a28 <= 37 && (input == 1)))) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1817] COND FALSE !(( a21 <= 127 && ( ((-114 < a14) && (-84 >= a14)) && ( 300 < a28 && ( ((-68 < a26) && (124 >= a26)) && ((a24==2) && (input == 2))))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1822] COND FALSE !((( ((124 < a26) && (217 >= a26)) && (((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 1)) && a21 <= 127 ) && a14 <= -182 )) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1828] COND FALSE !(( a21 <= 127 && (((a24==3) && (((input == 1) && 300 < a28 ) && ((124 < a26) && (217 >= a26)) )) && -84 < a14 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1841] COND FALSE !((((a24==3) && (( a21 <= 127 && ((input == 4) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )))) && ((-114 < a14) && (-84 >= a14)) )) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1847] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((( 300 < a28 && a14 <= -182 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 4))) && (a24==2)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1852] COND FALSE !((( a26 <= -68 && ((a24==2) && (( -84 < a14 && (input == 5)) && a21 <= 127 ))) && ((37 < a28) && (134 >= a28)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1855] COND FALSE !(((a24==2) && (((( 300 < a28 && ( ((124 < a26) && (217 >= a26)) && -84 < a14 )) || (( a14 <= -182 && 217 < a26 ) && a28 <= 37 )) && (input == 4)) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1862] COND FALSE !(((a24==3) && ( a14 <= -182 && ( ((37 < a28) && (134 >= a28)) && (((input == 3) && 217 < a26 ) && a21 <= 127 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1868] COND FALSE !(((a24==3) && ( -84 < a14 && (( 300 < a28 && ( a21 <= 127 && (input == 5))) && ((124 < a26) && (217 >= a26)) )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1878] COND FALSE !((((input == 2) && ((((a24==3) && ( a14 <= -182 && a26 <= -68 )) && a28 <= 37 ) || ((((a24==2) && ( 217 < a26 && -84 < a14 )) && ((134 < a28) && (300 >= a28)) ) || (((a24==2) && ( 217 < a26 && -84 < a14 )) && 300 < a28 )))) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1885] COND FALSE !((((( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))) && (a24==3)) && a21 <= 127 ) && a14 <= -182 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1891] COND FALSE !(( a14 <= -182 && ((( 217 < a26 && ((input == 5) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))) && (a24==3)) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1898] COND FALSE !(((a24==3) && ((( a26 <= -68 && ((input == 4) && a28 <= 37 )) && ((-182 < a14) && (-114 >= a14)) ) && a21 <= 127 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1905] COND FALSE !(( a14 <= -182 && ( a21 <= 127 && ((a24==3) && (((input == 1) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )) && a26 <= -68 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1910] COND FALSE !((((((a24==2) && ((input == 2) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ))) && a21 <= 127 ) && a26 <= -68 ) && ((-182 < a14) && (-114 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1916] COND FALSE !(((( -84 < a14 && (((a24==2) && (input == 4)) && ((124 < a26) && (217 >= a26)) )) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1926] COND FALSE !((( a14 <= -182 && ( a21 <= 127 && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 4)) && (a24==2)))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1932] COND FALSE !(((((( ((37 < a28) && (134 >= a28)) && (input == 4)) && (a24==2)) && a14 <= -182 ) && 217 < a26 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1937] COND FALSE !(( a21 <= 127 && (((((input == 3) && ((37 < a28) && (134 >= a28)) ) && -84 < a14 ) && (a24==2)) && a26 <= -68 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1942] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((a24==3) && ( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 4)))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1955] COND FALSE !(( a26 <= -68 && ((a24==2) && (( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 2))) && ((-114 < a14) && (-84 >= a14)) )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1960] COND FALSE !(( a26 <= -68 && ((a24==2) && ( ((37 < a28) && (134 >= a28)) && (( -84 < a14 && (input == 1)) && a21 <= 127 ))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1966] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 2)) && (a24==3))) && -84 < a14 ) && a26 <= -68 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1973] COND FALSE !(( 217 < a26 && (( a14 <= -182 && ( ((37 < a28) && (134 >= a28)) && ( a21 <= 127 && (input == 6)))) && (a24==3)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1985] COND FALSE !(((((a24==2) && ( 217 < a26 && ((( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ) && (input == 6)))) && a21 <= 127 ) && ((-114 < a14) && (-84 >= a14)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1989] COND FALSE !(((a24==2) && ( a21 <= 127 && ((input == 1) && (( 300 < a28 && ( -84 < a14 && ((124 < a26) && (217 >= a26)) )) || (( 217 < a26 && a14 <= -182 ) && a28 <= 37 )))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1994] COND FALSE !((((a24==3) && ( a21 <= 127 && ((input == 1) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2001] COND FALSE !(((((((input == 3) && a21 <= 127 ) && ((-182 < a14) && (-114 >= a14)) ) && ((124 < a26) && (217 >= a26)) ) && a28 <= 37 ) && (a24==2))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2005] COND FALSE !((((a24==3) && ( a21 <= 127 && (((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) )) && (input == 5)))) && ((-68 < a26) && (124 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2012] COND FALSE !(((((((input == 5) && ( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ))) && 217 < a26 ) && (a24==1)) && -84 < a14 ) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2017] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ((a24==2) && ( a21 <= 127 && ( a28 <= 37 && ((input == 6) && a14 <= -182 )))))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2020] COND FALSE !(((( a26 <= -68 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 5)) && ((-182 < a14) && (-114 >= a14)) )) && (a24==3)) && a21 <= 127 )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2026] COND FALSE !(( ((-114 < a14) && (-84 >= a14)) && (( a21 <= 127 && ((a24==3) && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)))) && ((124 < a26) && (217 >= a26)) ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2030] COND FALSE !(( a21 <= 127 && (( ((37 < a28) && (134 >= a28)) && ( a14 <= -182 && ( 217 < a26 && (input == 4)))) && (a24==3)))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2041] COND FALSE !(((a24==2) && ( a21 <= 127 && (((( a28 <= 37 && ((-114 < a14) && (-84 >= a14)) ) || (( ((-182 < a14) && (-114 >= a14)) && ((134 < a28) && (300 >= a28)) ) || ( ((-182 < a14) && (-114 >= a14)) && 300 < a28 ))) && (input == 3)) && ((-68 < a26) && (124 >= a26)) )))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2048] COND FALSE !((( a21 <= 127 && ((a24==3) && ( -84 < a14 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2053] COND FALSE !(( a21 <= 127 && ((( ((-68 < a26) && (124 >= a26)) && ((input == 5) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) || ((134 < a28) && (300 >= a28)) ))) && (a24==3)) && a14 <= -182 ))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2060] COND FALSE !((((( a21 <= 127 && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) && (input == 3))) && ((-182 < a14) && (-114 >= a14)) ) && ((-68 < a26) && (124 >= a26)) ) && (a24==3))) VAL [a14=-561446, a21=124, a24=2, a26=321561, a28=10159, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2067] COND TRUE ((a24==2) && ( 217 < a26 && (((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && a21 <= 127 ))) [L2068] a14 = ((((((a14 + 0) * 9)/ 10) + -27775) % 33)+ -126) [L2069] a28 = ((((a28 % 299849)+ 300149) - -1) - 0) [L2070] a24 = 1 [L2072] return -1; VAL [\result=-1, a14=-153, a21=124, a24=1, a26=321561, a28=310309, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1653] RET, EXPR calculate_output2(input) [L1653] return calculate_output2(input); [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-153, a21=124, a24=1, a26=321561, a28=310309, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-153, a21=124, a24=1, a26=321561, a28=310309, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-153, a21=124, a24=1, a26=321561, a28=310309, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-153, a21=124, a24=1, a26=321561, a28=310309, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) VAL [a14=-153, a21=124, a24=1, a26=321561, a28=310309, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) VAL [a14=-153, a21=124, a24=1, a26=321561, a28=310309, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) VAL [a14=-153, a21=124, a24=1, a26=321561, a28=310309, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND TRUE (((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 ) VAL [a14=-153, a21=124, a24=1, a26=321561, a28=310309, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] reach_error() VAL [a14=-153, a21=124, a24=1, a26=321561, a28=310309, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.4s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 42.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13967 SdHoareTripleChecker+Valid, 34.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13967 mSDsluCounter, 11542 SdHoareTripleChecker+Invalid, 29.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1791 mSDsCounter, 7978 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38444 IncrementalHoareTripleChecker+Invalid, 46422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7978 mSolverCounterUnsat, 9751 mSDtfsCounter, 38444 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4009 GetRequests, 3959 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139378occurred in iteration=22, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 61862 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 11769 NumberOfCodeBlocks, 11769 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 12523 ConstructedInterpolants, 0 QuantifiedInterpolants, 32916 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2897 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 21 PerfectInterpolantSequences, 9047/9758 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-01-09 00:16:53,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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