./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49e10e55e7f24ac0e1cc4811d9fd20f6e770a7f556bf19e67f8acc4167c82fd3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:26:16,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:26:16,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:26:16,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:26:16,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:26:16,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:26:16,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:26:16,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:26:16,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:26:16,768 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:26:16,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:26:16,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:26:16,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:26:16,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:26:16,769 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:26:16,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:26:16,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:26:16,770 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:26:16,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:26:16,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:26:16,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:26:16,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:26:16,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:26:16,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:26:16,776 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:26:16,776 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:26:16,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:26:16,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:26:16,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:26:16,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:26:16,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:26:16,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:26:16,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:26:16,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:26:16,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:26:16,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:26:16,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:26:16,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:26:16,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:26:16,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:26:16,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:26:16,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:26:16,780 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 49e10e55e7f24ac0e1cc4811d9fd20f6e770a7f556bf19e67f8acc4167c82fd3 [2024-10-12 16:26:16,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:26:16,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:26:16,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:26:16,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:26:16,995 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:26:16,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label04.c [2024-10-12 16:26:18,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:26:18,503 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:26:18,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label04.c [2024-10-12 16:26:18,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00ae6a7b/7f0bc4e9103c4ca5ada20341e58c2086/FLAGc42dbb8ba [2024-10-12 16:26:18,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00ae6a7b/7f0bc4e9103c4ca5ada20341e58c2086 [2024-10-12 16:26:18,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:26:18,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:26:18,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:26:18,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:26:18,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:26:18,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:26:18" (1/1) ... [2024-10-12 16:26:18,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3453677b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:18, skipping insertion in model container [2024-10-12 16:26:18,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:26:18" (1/1) ... [2024-10-12 16:26:18,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:26:19,030 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label04.c[3138,3151] [2024-10-12 16:26:19,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:26:19,442 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:26:19,458 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label04.c[3138,3151] [2024-10-12 16:26:19,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:26:19,640 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:26:19,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19 WrapperNode [2024-10-12 16:26:19,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:26:19,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:26:19,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:26:19,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:26:19,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:19,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:19,943 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-12 16:26:19,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:26:19,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:26:19,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:26:19,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:26:19,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:19,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:19,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:20,114 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 16:26:20,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:20,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:20,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:20,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:20,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:20,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:20,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:26:20,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:26:20,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:26:20,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:26:20,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (1/1) ... [2024-10-12 16:26:20,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:26:20,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:26:20,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:26:20,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:26:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:26:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:26:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:26:20,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:26:20,456 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:26:20,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:26:22,893 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-12 16:26:22,894 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:26:22,939 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:26:22,942 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:26:22,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:26:22 BoogieIcfgContainer [2024-10-12 16:26:22,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:26:22,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:26:22,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:26:22,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:26:22,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:26:18" (1/3) ... [2024-10-12 16:26:22,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546ed02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:26:22, skipping insertion in model container [2024-10-12 16:26:22,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:19" (2/3) ... [2024-10-12 16:26:22,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546ed02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:26:22, skipping insertion in model container [2024-10-12 16:26:22,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:26:22" (3/3) ... [2024-10-12 16:26:22,951 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label04.c [2024-10-12 16:26:22,963 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:26:22,963 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:26:23,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:26:23,033 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;@461798f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:26:23,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:26:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 16:26:23,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:23,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:23,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:23,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:23,050 INFO L85 PathProgramCache]: Analyzing trace with hash -445683688, now seen corresponding path program 1 times [2024-10-12 16:26:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:23,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326766050] [2024-10-12 16:26:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:23,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:23,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:23,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326766050] [2024-10-12 16:26:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326766050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:23,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:23,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:23,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256950822] [2024-10-12 16:26:23,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:23,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:26:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:23,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:26:23,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:26:23,216 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:23,268 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-12 16:26:23,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:26:23,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 16:26:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:23,284 INFO L225 Difference]: With dead ends: 1055 [2024-10-12 16:26:23,284 INFO L226 Difference]: Without dead ends: 526 [2024-10-12 16:26:23,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:26:23,293 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:23,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:26:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-12 16:26:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-12 16:26:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-12 16:26:23,362 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 19 [2024-10-12 16:26:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:23,362 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-12 16:26:23,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-12 16:26:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 16:26:23,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:23,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:23,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:26:23,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:23,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:23,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1699173398, now seen corresponding path program 1 times [2024-10-12 16:26:23,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:23,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399529895] [2024-10-12 16:26:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399529895] [2024-10-12 16:26:23,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399529895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:23,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:23,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:23,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148369970] [2024-10-12 16:26:23,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:23,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:23,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:23,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:23,477 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:25,422 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2024-10-12 16:26:25,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:25,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 16:26:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:25,426 INFO L225 Difference]: With dead ends: 1501 [2024-10-12 16:26:25,426 INFO L226 Difference]: Without dead ends: 976 [2024-10-12 16:26:25,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:25,428 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 452 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:25,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 448 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 16:26:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-12 16:26:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-12 16:26:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-12 16:26:25,454 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 19 [2024-10-12 16:26:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:25,454 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-12 16:26:25,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-12 16:26:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 16:26:25,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:25,457 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 16:26:25,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:26:25,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:25,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash 203579826, now seen corresponding path program 1 times [2024-10-12 16:26:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14616536] [2024-10-12 16:26:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:25,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:25,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14616536] [2024-10-12 16:26:25,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14616536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:25,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:25,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:25,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377133485] [2024-10-12 16:26:25,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:25,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:25,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:25,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:25,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:25,630 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:27,394 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2024-10-12 16:26:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:27,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-12 16:26:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:27,400 INFO L225 Difference]: With dead ends: 2812 [2024-10-12 16:26:27,400 INFO L226 Difference]: Without dead ends: 1843 [2024-10-12 16:26:27,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:27,404 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:27,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 577 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:26:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-12 16:26:27,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2024-10-12 16:26:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2024-10-12 16:26:27,438 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 86 [2024-10-12 16:26:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:27,439 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2024-10-12 16:26:27,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2024-10-12 16:26:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 16:26:27,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:27,442 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 16:26:27,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:26:27,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:27,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1423545686, now seen corresponding path program 1 times [2024-10-12 16:26:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051402659] [2024-10-12 16:26:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:27,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:27,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051402659] [2024-10-12 16:26:27,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051402659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:27,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:27,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:27,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987098858] [2024-10-12 16:26:27,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:27,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:27,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:27,607 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:29,191 INFO L93 Difference]: Finished difference Result 4551 states and 6281 transitions. [2024-10-12 16:26:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-12 16:26:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:29,199 INFO L225 Difference]: With dead ends: 4551 [2024-10-12 16:26:29,199 INFO L226 Difference]: Without dead ends: 2712 [2024-10-12 16:26:29,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:29,201 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 487 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:29,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 883 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:26:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2024-10-12 16:26:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2710. [2024-10-12 16:26:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.3004798818752308) internal successors, (3523), 2709 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3523 transitions. [2024-10-12 16:26:29,231 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3523 transitions. Word has length 89 [2024-10-12 16:26:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:29,232 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3523 transitions. [2024-10-12 16:26:29,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3523 transitions. [2024-10-12 16:26:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-12 16:26:29,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:29,235 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:29,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:26:29,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:29,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1465367745, now seen corresponding path program 1 times [2024-10-12 16:26:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:29,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750653796] [2024-10-12 16:26:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 16:26:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750653796] [2024-10-12 16:26:29,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750653796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:29,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:29,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:29,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79495425] [2024-10-12 16:26:29,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:29,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:29,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:29,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:29,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:29,382 INFO L87 Difference]: Start difference. First operand 2710 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:30,845 INFO L93 Difference]: Finished difference Result 7983 states and 10360 transitions. [2024-10-12 16:26:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2024-10-12 16:26:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:30,856 INFO L225 Difference]: With dead ends: 7983 [2024-10-12 16:26:30,856 INFO L226 Difference]: Without dead ends: 4420 [2024-10-12 16:26:30,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:30,859 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:30,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:26:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-10-12 16:26:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3570. [2024-10-12 16:26:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 3569 states have (on average 1.177640795741104) internal successors, (4203), 3569 states have internal predecessors, (4203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 4203 transitions. [2024-10-12 16:26:30,900 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 4203 transitions. Word has length 158 [2024-10-12 16:26:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:30,900 INFO L471 AbstractCegarLoop]: Abstraction has 3570 states and 4203 transitions. [2024-10-12 16:26:30,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 4203 transitions. [2024-10-12 16:26:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 16:26:30,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:30,902 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:30,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:26:30,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -357741427, now seen corresponding path program 1 times [2024-10-12 16:26:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399166221] [2024-10-12 16:26:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:30,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:31,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:31,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399166221] [2024-10-12 16:26:31,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399166221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:31,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:31,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:31,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740718388] [2024-10-12 16:26:31,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:31,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:31,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:31,071 INFO L87 Difference]: Start difference. First operand 3570 states and 4203 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:32,352 INFO L93 Difference]: Finished difference Result 9272 states and 11086 transitions. [2024-10-12 16:26:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:32,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2024-10-12 16:26:32,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:32,367 INFO L225 Difference]: With dead ends: 9272 [2024-10-12 16:26:32,367 INFO L226 Difference]: Without dead ends: 5703 [2024-10-12 16:26:32,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:32,371 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:32,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 781 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:26:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2024-10-12 16:26:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5703. [2024-10-12 16:26:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5703 states, 5702 states have (on average 1.1595931252192213) internal successors, (6612), 5702 states have internal predecessors, (6612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 6612 transitions. [2024-10-12 16:26:32,459 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 6612 transitions. Word has length 171 [2024-10-12 16:26:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:32,460 INFO L471 AbstractCegarLoop]: Abstraction has 5703 states and 6612 transitions. [2024-10-12 16:26:32,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 6612 transitions. [2024-10-12 16:26:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-12 16:26:32,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:32,464 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 16:26:32,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:26:32,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:32,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:32,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2024135048, now seen corresponding path program 1 times [2024-10-12 16:26:32,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:32,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654757100] [2024-10-12 16:26:32,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:32,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:26:32,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654757100] [2024-10-12 16:26:32,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654757100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:32,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:32,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:32,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626371345] [2024-10-12 16:26:32,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:32,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:32,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:32,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:32,605 INFO L87 Difference]: Start difference. First operand 5703 states and 6612 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:33,888 INFO L93 Difference]: Finished difference Result 14375 states and 16775 transitions. [2024-10-12 16:26:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:33,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 173 [2024-10-12 16:26:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:33,907 INFO L225 Difference]: With dead ends: 14375 [2024-10-12 16:26:33,907 INFO L226 Difference]: Without dead ends: 8672 [2024-10-12 16:26:33,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:33,915 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 430 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:33,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 442 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:26:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8672 states. [2024-10-12 16:26:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8672 to 5676. [2024-10-12 16:26:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5676 states, 5675 states have (on average 1.157885462555066) internal successors, (6571), 5675 states have internal predecessors, (6571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 6571 transitions. [2024-10-12 16:26:34,024 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 6571 transitions. Word has length 173 [2024-10-12 16:26:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:34,025 INFO L471 AbstractCegarLoop]: Abstraction has 5676 states and 6571 transitions. [2024-10-12 16:26:34,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 6571 transitions. [2024-10-12 16:26:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-12 16:26:34,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:34,028 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:34,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:26:34,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:34,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -888719125, now seen corresponding path program 1 times [2024-10-12 16:26:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:34,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378211692] [2024-10-12 16:26:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-12 16:26:34,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:34,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378211692] [2024-10-12 16:26:34,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378211692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:34,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:34,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:34,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389959147] [2024-10-12 16:26:34,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:34,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:34,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:34,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:34,243 INFO L87 Difference]: Start difference. First operand 5676 states and 6571 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:35,585 INFO L93 Difference]: Finished difference Result 13934 states and 16237 transitions. [2024-10-12 16:26:35,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:35,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 251 [2024-10-12 16:26:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:35,605 INFO L225 Difference]: With dead ends: 13934 [2024-10-12 16:26:35,606 INFO L226 Difference]: Without dead ends: 7831 [2024-10-12 16:26:35,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:35,618 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 495 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:35,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 626 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:26:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7831 states. [2024-10-12 16:26:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7831 to 7401. [2024-10-12 16:26:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7401 states, 7400 states have (on average 1.163918918918919) internal successors, (8613), 7400 states have internal predecessors, (8613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7401 states to 7401 states and 8613 transitions. [2024-10-12 16:26:35,743 INFO L78 Accepts]: Start accepts. Automaton has 7401 states and 8613 transitions. Word has length 251 [2024-10-12 16:26:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:35,744 INFO L471 AbstractCegarLoop]: Abstraction has 7401 states and 8613 transitions. [2024-10-12 16:26:35,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 7401 states and 8613 transitions. [2024-10-12 16:26:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-12 16:26:35,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:35,747 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:35,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:26:35,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:35,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash 14078936, now seen corresponding path program 1 times [2024-10-12 16:26:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:35,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760977265] [2024-10-12 16:26:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:35,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-12 16:26:35,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760977265] [2024-10-12 16:26:35,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760977265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:35,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:35,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487987078] [2024-10-12 16:26:35,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:35,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:35,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:35,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:35,900 INFO L87 Difference]: Start difference. First operand 7401 states and 8613 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:37,310 INFO L93 Difference]: Finished difference Result 19037 states and 22310 transitions. [2024-10-12 16:26:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:37,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 256 [2024-10-12 16:26:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:37,325 INFO L225 Difference]: With dead ends: 19037 [2024-10-12 16:26:37,325 INFO L226 Difference]: Without dead ends: 11212 [2024-10-12 16:26:37,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:37,332 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 379 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:37,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 839 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:26:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11212 states. [2024-10-12 16:26:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11212 to 10362. [2024-10-12 16:26:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10362 states, 10361 states have (on average 1.132130103271885) internal successors, (11730), 10361 states have internal predecessors, (11730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10362 states to 10362 states and 11730 transitions. [2024-10-12 16:26:37,452 INFO L78 Accepts]: Start accepts. Automaton has 10362 states and 11730 transitions. Word has length 256 [2024-10-12 16:26:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:37,453 INFO L471 AbstractCegarLoop]: Abstraction has 10362 states and 11730 transitions. [2024-10-12 16:26:37,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 10362 states and 11730 transitions. [2024-10-12 16:26:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-12 16:26:37,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:37,456 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:26:37,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:26:37,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:37,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:37,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1860016304, now seen corresponding path program 1 times [2024-10-12 16:26:37,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:37,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217827350] [2024-10-12 16:26:37,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:37,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:26:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:37,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217827350] [2024-10-12 16:26:37,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217827350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:37,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:37,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:37,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742463134] [2024-10-12 16:26:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:37,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:37,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:37,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:37,721 INFO L87 Difference]: Start difference. First operand 10362 states and 11730 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:39,073 INFO L93 Difference]: Finished difference Result 24566 states and 27906 transitions. [2024-10-12 16:26:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:39,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 274 [2024-10-12 16:26:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:39,090 INFO L225 Difference]: With dead ends: 24566 [2024-10-12 16:26:39,090 INFO L226 Difference]: Without dead ends: 13773 [2024-10-12 16:26:39,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:39,099 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 443 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:39,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 293 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:26:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13773 states. [2024-10-12 16:26:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13773 to 12917. [2024-10-12 16:26:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12917 states, 12916 states have (on average 1.1388974914834313) internal successors, (14710), 12916 states have internal predecessors, (14710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12917 states to 12917 states and 14710 transitions. [2024-10-12 16:26:39,275 INFO L78 Accepts]: Start accepts. Automaton has 12917 states and 14710 transitions. Word has length 274 [2024-10-12 16:26:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:39,276 INFO L471 AbstractCegarLoop]: Abstraction has 12917 states and 14710 transitions. [2024-10-12 16:26:39,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 12917 states and 14710 transitions. [2024-10-12 16:26:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-12 16:26:39,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:39,281 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:26:39,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:26:39,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:39,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash -18752365, now seen corresponding path program 1 times [2024-10-12 16:26:39,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:39,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82522779] [2024-10-12 16:26:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:26:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:39,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82522779] [2024-10-12 16:26:39,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82522779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:39,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:39,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:26:39,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916055846] [2024-10-12 16:26:39,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:39,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:26:39,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:39,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:26:39,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:26:39,607 INFO L87 Difference]: Start difference. First operand 12917 states and 14710 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:41,826 INFO L93 Difference]: Finished difference Result 46350 states and 52888 transitions. [2024-10-12 16:26:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:26:41,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 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 279 [2024-10-12 16:26:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:41,864 INFO L225 Difference]: With dead ends: 46350 [2024-10-12 16:26:41,864 INFO L226 Difference]: Without dead ends: 32153 [2024-10-12 16:26:41,879 INFO L431 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 [2024-10-12 16:26:41,880 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 904 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2615 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:41,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 300 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 2615 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 16:26:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32153 states. [2024-10-12 16:26:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32153 to 31676. [2024-10-12 16:26:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31676 states, 31675 states have (on average 1.124672454617206) internal successors, (35624), 31675 states have internal predecessors, (35624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31676 states to 31676 states and 35624 transitions. [2024-10-12 16:26:42,185 INFO L78 Accepts]: Start accepts. Automaton has 31676 states and 35624 transitions. Word has length 279 [2024-10-12 16:26:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:42,186 INFO L471 AbstractCegarLoop]: Abstraction has 31676 states and 35624 transitions. [2024-10-12 16:26:42,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31676 states and 35624 transitions. [2024-10-12 16:26:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-10-12 16:26:42,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:42,190 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:42,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:26:42,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:42,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1030374557, now seen corresponding path program 1 times [2024-10-12 16:26:42,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:42,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696222688] [2024-10-12 16:26:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:26:42,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:42,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696222688] [2024-10-12 16:26:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696222688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:42,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:42,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:42,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162483515] [2024-10-12 16:26:42,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:42,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:42,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:42,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:42,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:42,471 INFO L87 Difference]: Start difference. First operand 31676 states and 35624 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:43,970 INFO L93 Difference]: Finished difference Result 76997 states and 86990 transitions. [2024-10-12 16:26:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:43,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2024-10-12 16:26:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:44,008 INFO L225 Difference]: With dead ends: 76997 [2024-10-12 16:26:44,008 INFO L226 Difference]: Without dead ends: 44893 [2024-10-12 16:26:44,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:44,020 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 463 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:44,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 424 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:26:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44893 states. [2024-10-12 16:26:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44893 to 43161. [2024-10-12 16:26:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43161 states, 43160 states have (on average 1.1074142724745135) internal successors, (47796), 43160 states have internal predecessors, (47796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43161 states to 43161 states and 47796 transitions. [2024-10-12 16:26:44,374 INFO L78 Accepts]: Start accepts. Automaton has 43161 states and 47796 transitions. Word has length 308 [2024-10-12 16:26:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:44,374 INFO L471 AbstractCegarLoop]: Abstraction has 43161 states and 47796 transitions. [2024-10-12 16:26:44,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:44,374 INFO L276 IsEmpty]: Start isEmpty. Operand 43161 states and 47796 transitions. [2024-10-12 16:26:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-10-12 16:26:44,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:44,378 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:26:44,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:26:44,379 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:44,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:44,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1994803995, now seen corresponding path program 1 times [2024-10-12 16:26:44,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:44,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908009565] [2024-10-12 16:26:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 217 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:45,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:45,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908009565] [2024-10-12 16:26:45,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908009565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:26:45,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6326804] [2024-10-12 16:26:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:45,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:26:45,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:26:45,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:26:45,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:26:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:45,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 16:26:45,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:26:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 222 proven. 82 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 16:26:45,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:26:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 222 proven. 82 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 16:26:46,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6326804] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 16:26:46,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 16:26:46,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-10-12 16:26:46,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180046530] [2024-10-12 16:26:46,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 16:26:46,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 16:26:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:46,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 16:26:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:26:46,369 INFO L87 Difference]: Start difference. First operand 43161 states and 47796 transitions. Second operand has 9 states, 9 states have (on average 88.66666666666667) internal successors, (798), 9 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:55,738 INFO L93 Difference]: Finished difference Result 163440 states and 181225 transitions. [2024-10-12 16:26:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 16:26:55,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 88.66666666666667) internal successors, (798), 9 states have internal predecessors, (798), 0 states have call successors, (0), 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 314 [2024-10-12 16:26:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:55,860 INFO L225 Difference]: With dead ends: 163440 [2024-10-12 16:26:55,860 INFO L226 Difference]: Without dead ends: 116019 [2024-10-12 16:26:55,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2024-10-12 16:26:55,895 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 12490 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 12356 mSolverCounterSat, 2396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12490 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 14752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2396 IncrementalHoareTripleChecker+Valid, 12356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:55,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12490 Valid, 511 Invalid, 14752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2396 Valid, 12356 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-10-12 16:26:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116019 states. [2024-10-12 16:26:57,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116019 to 92126. [2024-10-12 16:26:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92126 states, 92125 states have (on average 1.1032944369063773) internal successors, (101641), 92125 states have internal predecessors, (101641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92126 states to 92126 states and 101641 transitions. [2024-10-12 16:26:57,242 INFO L78 Accepts]: Start accepts. Automaton has 92126 states and 101641 transitions. Word has length 314 [2024-10-12 16:26:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:57,242 INFO L471 AbstractCegarLoop]: Abstraction has 92126 states and 101641 transitions. [2024-10-12 16:26:57,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.66666666666667) internal successors, (798), 9 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 92126 states and 101641 transitions. [2024-10-12 16:26:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-10-12 16:26:57,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:57,249 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:57,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:26:57,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-12 16:26:57,451 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:57,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:57,451 INFO L85 PathProgramCache]: Analyzing trace with hash 147636294, now seen corresponding path program 1 times [2024-10-12 16:26:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:57,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104417369] [2024-10-12 16:26:57,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:57,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 233 proven. 82 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 16:26:58,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:58,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104417369] [2024-10-12 16:26:58,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104417369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:26:58,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263685778] [2024-10-12 16:26:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:58,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:26:58,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:26:58,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:26:58,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:26:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:58,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 16:26:58,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:26:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 233 proven. 82 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 16:26:59,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:27:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 233 proven. 82 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 16:27:00,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263685778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 16:27:00,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 16:27:00,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-10-12 16:27:00,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408687817] [2024-10-12 16:27:00,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 16:27:00,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 16:27:00,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:00,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 16:27:00,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-12 16:27:00,418 INFO L87 Difference]: Start difference. First operand 92126 states and 101641 transitions. Second operand has 8 states, 8 states have (on average 101.375) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:05,224 INFO L93 Difference]: Finished difference Result 217452 states and 240265 transitions. [2024-10-12 16:27:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 16:27:05,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 101.375) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 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 366 [2024-10-12 16:27:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:05,353 INFO L225 Difference]: With dead ends: 217452 [2024-10-12 16:27:05,353 INFO L226 Difference]: Without dead ends: 125752 [2024-10-12 16:27:05,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:27:05,391 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 2653 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 5484 mSolverCounterSat, 1182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2653 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 6666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1182 IncrementalHoareTripleChecker+Valid, 5484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:05,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2653 Valid, 318 Invalid, 6666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1182 Valid, 5484 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 16:27:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125752 states. [2024-10-12 16:27:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125752 to 109137. [2024-10-12 16:27:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109137 states, 109136 states have (on average 1.1063168890192054) internal successors, (120739), 109136 states have internal predecessors, (120739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109137 states to 109137 states and 120739 transitions. [2024-10-12 16:27:07,105 INFO L78 Accepts]: Start accepts. Automaton has 109137 states and 120739 transitions. Word has length 366 [2024-10-12 16:27:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:07,105 INFO L471 AbstractCegarLoop]: Abstraction has 109137 states and 120739 transitions. [2024-10-12 16:27:07,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.375) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 109137 states and 120739 transitions. [2024-10-12 16:27:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-10-12 16:27:07,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:07,108 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:27:07,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:27:07,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-12 16:27:07,310 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:07,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1968781327, now seen corresponding path program 1 times [2024-10-12 16:27:07,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:07,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223061436] [2024-10-12 16:27:07,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-12 16:27:07,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:07,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223061436] [2024-10-12 16:27:07,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223061436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:27:07,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:27:07,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:27:07,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316228761] [2024-10-12 16:27:07,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:07,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:27:07,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:07,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:27:07,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:07,627 INFO L87 Difference]: Start difference. First operand 109137 states and 120739 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:09,291 INFO L93 Difference]: Finished difference Result 214860 states and 237723 transitions. [2024-10-12 16:27:09,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:27:09,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 388 [2024-10-12 16:27:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:09,414 INFO L225 Difference]: With dead ends: 214860 [2024-10-12 16:27:09,414 INFO L226 Difference]: Without dead ends: 106148 [2024-10-12 16:27:09,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:09,439 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 481 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:09,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 717 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:27:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106148 states. [2024-10-12 16:27:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106148 to 104442. [2024-10-12 16:27:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104442 states, 104441 states have (on average 1.0791355885140892) internal successors, (112706), 104441 states have internal predecessors, (112706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104442 states to 104442 states and 112706 transitions. [2024-10-12 16:27:10,649 INFO L78 Accepts]: Start accepts. Automaton has 104442 states and 112706 transitions. Word has length 388 [2024-10-12 16:27:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:10,650 INFO L471 AbstractCegarLoop]: Abstraction has 104442 states and 112706 transitions. [2024-10-12 16:27:10,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 104442 states and 112706 transitions. [2024-10-12 16:27:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2024-10-12 16:27:10,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:10,655 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:27:10,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:27:10,655 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:10,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 334479300, now seen corresponding path program 1 times [2024-10-12 16:27:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:10,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676961415] [2024-10-12 16:27:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-12 16:27:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676961415] [2024-10-12 16:27:11,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676961415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:27:11,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:27:11,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:27:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633392782] [2024-10-12 16:27:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:11,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:27:11,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:11,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:27:11,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:11,270 INFO L87 Difference]: Start difference. First operand 104442 states and 112706 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:12,875 INFO L93 Difference]: Finished difference Result 219101 states and 236171 transitions. [2024-10-12 16:27:12,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:27:12,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 457 [2024-10-12 16:27:12,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:13,027 INFO L225 Difference]: With dead ends: 219101 [2024-10-12 16:27:13,027 INFO L226 Difference]: Without dead ends: 115085 [2024-10-12 16:27:13,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:13,069 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 355 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:13,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 352 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:27:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115085 states. [2024-10-12 16:27:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115085 to 111666. [2024-10-12 16:27:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111666 states, 111665 states have (on average 1.0762100926879505) internal successors, (120175), 111665 states have internal predecessors, (120175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111666 states to 111666 states and 120175 transitions. [2024-10-12 16:27:14,436 INFO L78 Accepts]: Start accepts. Automaton has 111666 states and 120175 transitions. Word has length 457 [2024-10-12 16:27:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:14,436 INFO L471 AbstractCegarLoop]: Abstraction has 111666 states and 120175 transitions. [2024-10-12 16:27:14,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 111666 states and 120175 transitions. [2024-10-12 16:27:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2024-10-12 16:27:14,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:14,443 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:27:14,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:27:14,443 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:14,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash 674778098, now seen corresponding path program 1 times [2024-10-12 16:27:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:14,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196764768] [2024-10-12 16:27:14,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:14,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-12 16:27:15,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:15,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196764768] [2024-10-12 16:27:15,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196764768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:27:15,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:27:15,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:27:15,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164759607] [2024-10-12 16:27:15,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:15,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:27:15,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:15,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:27:15,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:15,047 INFO L87 Difference]: Start difference. First operand 111666 states and 120175 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:16,699 INFO L93 Difference]: Finished difference Result 239531 states and 257834 transitions. [2024-10-12 16:27:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:27:16,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 470 [2024-10-12 16:27:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:16,831 INFO L225 Difference]: With dead ends: 239531 [2024-10-12 16:27:16,832 INFO L226 Difference]: Without dead ends: 127863 [2024-10-12 16:27:16,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:16,890 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 326 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:16,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 345 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:27:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127863 states. [2024-10-12 16:27:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127863 to 110389. [2024-10-12 16:27:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110389 states, 110388 states have (on average 1.072082110374316) internal successors, (118345), 110388 states have internal predecessors, (118345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110389 states to 110389 states and 118345 transitions. [2024-10-12 16:27:18,524 INFO L78 Accepts]: Start accepts. Automaton has 110389 states and 118345 transitions. Word has length 470 [2024-10-12 16:27:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:18,524 INFO L471 AbstractCegarLoop]: Abstraction has 110389 states and 118345 transitions. [2024-10-12 16:27:18,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:27:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 110389 states and 118345 transitions. [2024-10-12 16:27:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-10-12 16:27:18,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:18,533 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:27:18,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:27:18,533 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:18,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:18,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1704581566, now seen corresponding path program 1 times [2024-10-12 16:27:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:18,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361268095] [2024-10-12 16:27:18,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 16:27:18,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 16:27:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 16:27:19,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 16:27:19,200 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 16:27:19,202 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:27:19,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:27:19,206 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:27:19,336 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:27:19,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:27:19 BoogieIcfgContainer [2024-10-12 16:27:19,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:27:19,339 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:27:19,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:27:19,339 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:27:19,340 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:26:22" (3/4) ... [2024-10-12 16:27:19,340 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 16:27:19,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:27:19,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:27:19,479 INFO L158 Benchmark]: Toolchain (without parser) took 60705.05ms. Allocated memory was 155.2MB in the beginning and 10.5GB in the end (delta: 10.3GB). Free memory was 76.3MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-10-12 16:27:19,479 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:27:19,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 866.05ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 76.2MB in the beginning and 70.5MB in the end (delta: 5.7MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2024-10-12 16:27:19,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 302.26ms. Allocated memory is still 213.9MB. Free memory was 70.5MB in the beginning and 118.6MB in the end (delta: -48.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-12 16:27:19,479 INFO L158 Benchmark]: Boogie Preprocessor took 327.86ms. Allocated memory is still 213.9MB. Free memory was 118.6MB in the beginning and 99.0MB in the end (delta: 19.6MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2024-10-12 16:27:19,479 INFO L158 Benchmark]: RCFGBuilder took 2669.46ms. Allocated memory was 213.9MB in the beginning and 396.4MB in the end (delta: 182.5MB). Free memory was 99.0MB in the beginning and 259.9MB in the end (delta: -160.8MB). Peak memory consumption was 140.1MB. Max. memory is 16.1GB. [2024-10-12 16:27:19,480 INFO L158 Benchmark]: TraceAbstraction took 56394.25ms. Allocated memory was 396.4MB in the beginning and 10.5GB in the end (delta: 10.1GB). Free memory was 258.8MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-10-12 16:27:19,480 INFO L158 Benchmark]: Witness Printer took 139.18ms. Allocated memory is still 10.5GB. Free memory was 8.6GB in the beginning and 8.5GB in the end (delta: 44.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-12 16:27:19,481 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.16ms. Allocated memory is still 155.2MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 866.05ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 76.2MB in the beginning and 70.5MB in the end (delta: 5.7MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 302.26ms. Allocated memory is still 213.9MB. Free memory was 70.5MB in the beginning and 118.6MB in the end (delta: -48.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 327.86ms. Allocated memory is still 213.9MB. Free memory was 118.6MB in the beginning and 99.0MB in the end (delta: 19.6MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2669.46ms. Allocated memory was 213.9MB in the beginning and 396.4MB in the end (delta: 182.5MB). Free memory was 99.0MB in the beginning and 259.9MB in the end (delta: -160.8MB). Peak memory consumption was 140.1MB. Max. memory is 16.1GB. * TraceAbstraction took 56394.25ms. Allocated memory was 396.4MB in the beginning and 10.5GB in the end (delta: 10.1GB). Free memory was 258.8MB in the beginning and 8.6GB in the end (delta: -8.3GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 139.18ms. Allocated memory is still 10.5GB. Free memory was 8.6GB in the beginning and 8.5GB in the end (delta: 44.9MB). Peak memory consumption was 44.0MB. 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: 78]: 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; [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] [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [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) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [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) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-300170, a21=124, a24=2, a26=-554655, a28=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, 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=11098, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND TRUE ( a26 <= -68 && ( a21 <= 127 && ((a24==2) && ((( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 )) && (input == 2))))) [L782] a14 = (((((a14 % 33)+ -142) - -4) + -282598) - -282592) [L783] a26 = ((((a26 % 95)- -83) + -28) + 38) [L784] a28 = ((((a28 + 0) / 5) % 48)+ 85) [L785] return 26; VAL [\result=26, a14=-146, a21=124, a24=2, a26=48, a28=96, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL, EXPR calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, 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=-146, a21=124, a24=2, a26=48, a28=96, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L545] COND TRUE ( a21 <= 127 && (((((input == 3) && ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (a24==2)) && ((-68 < a26) && (124 >= a26)) ) && ((-182 < a14) && (-114 >= a14)) )) [L546] a26 = (((a26 + 270287) + -547491) / 5) [L547] a28 = ((((a28 % 48)+ 86) / 5) - -54) [L548] a24 = 1 [L550] return -1; VAL [\result=-1, a14=-146, a21=124, a24=1, a26=-55431, a28=71, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L2598] RET, EXPR calculate_output(input) [L2598] output = calculate_output(input) [L2590] COND TRUE 1 [L2593] int input; [L2594] input = __VERIFIER_nondet_int() [L2595] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2598] CALL calculate_output(input) [L35] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) VAL [a14=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, 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=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND TRUE (((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 ) VAL [a14=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] reach_error() VAL [a14=-146, a21=124, a24=1, a26=-55431, a28=71, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 528 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.2s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 37.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21645 SdHoareTripleChecker+Valid, 32.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21645 mSDsluCounter, 9380 SdHoareTripleChecker+Invalid, 26.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1521 mSDsCounter, 7727 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36550 IncrementalHoareTripleChecker+Invalid, 44277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7727 mSolverCounterUnsat, 7859 mSDtfsCounter, 36550 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1435 GetRequests, 1392 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111666occurred in iteration=16, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 71309 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 5303 NumberOfCodeBlocks, 5303 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5417 ConstructedInterpolants, 0 QuantifiedInterpolants, 20713 SizeOfPredicates, 2 NumberOfNonLiveVariables, 933 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 4492/5007 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-12 16:27:19,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE