./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label57.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bea9e19089383bc0164dc4e36aa721d6c44729d5672e3fc5e450e2d0c7d34e28 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:59:48,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:59:48,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:59:48,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:59:48,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:59:48,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:59:48,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:59:48,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:59:48,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:59:48,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:59:48,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:59:48,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:59:48,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:59:48,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:59:48,201 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:59:48,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:59:48,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:59:48,201 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:59:48,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:59:48,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:59:48,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:59:48,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:59:48,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:59:48,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:59:48,202 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:59:48,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:59:48,202 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:59:48,202 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:59:48,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:48,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:48,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:59:48,203 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bea9e19089383bc0164dc4e36aa721d6c44729d5672e3fc5e450e2d0c7d34e28 [2025-01-08 23:59:48,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:59:48,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:59:48,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:59:48,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:59:48,394 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:59:48,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label57.c [2025-01-08 23:59:49,637 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41f9e1fd3/7bc31b7735aa40a18bc9bc6435148e78/FLAGb6c32a728 [2025-01-08 23:59:50,008 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:59:50,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label57.c [2025-01-08 23:59:50,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41f9e1fd3/7bc31b7735aa40a18bc9bc6435148e78/FLAGb6c32a728 [2025-01-08 23:59:50,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41f9e1fd3/7bc31b7735aa40a18bc9bc6435148e78 [2025-01-08 23:59:50,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:59:50,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:59:50,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:59:50,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:59:50,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:59:50,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bafcea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50, skipping insertion in model container [2025-01-08 23:59:50,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:59:50,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label57.c[3243,3256] [2025-01-08 23:59:50,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:59:50,545 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:59:50,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label57.c[3243,3256] [2025-01-08 23:59:50,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:59:50,615 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:59:50,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50 WrapperNode [2025-01-08 23:59:50,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:59:50,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:59:50,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:59:50,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:59:50,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,680 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-01-08 23:59:50,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:59:50,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:59:50,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:59:50,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:59:50,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,725 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:59:50,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,744 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:59:50,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:59:50,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:59:50,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:59:50,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (1/1) ... [2025-01-08 23:59:50,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:59:50,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:50,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:59:50,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:59:50,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:59:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:59:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:59:50,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:59:50,865 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:59:50,867 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:59:51,725 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 23:59:51,725 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:59:51,741 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:59:51,741 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:59:51,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:59:51 BoogieIcfgContainer [2025-01-08 23:59:51,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:59:51,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:59:51,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:59:51,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:59:51,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:59:50" (1/3) ... [2025-01-08 23:59:51,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9c2fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:59:51, skipping insertion in model container [2025-01-08 23:59:51,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:59:50" (2/3) ... [2025-01-08 23:59:51,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9c2fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:59:51, skipping insertion in model container [2025-01-08 23:59:51,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:59:51" (3/3) ... [2025-01-08 23:59:51,750 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label57.c [2025-01-08 23:59:51,761 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:59:51,763 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label57.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:59:51,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:59:51,809 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;@2db014ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:59:51,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:59:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 23:59:51,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:51,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:51,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:51,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:51,822 INFO L85 PathProgramCache]: Analyzing trace with hash -405900566, now seen corresponding path program 1 times [2025-01-08 23:59:51,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044794267] [2025-01-08 23:59:51,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:51,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 23:59:51,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 23:59:51,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:51,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:59:52,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044794267] [2025-01-08 23:59:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044794267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:52,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:52,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:52,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639008590] [2025-01-08 23:59:52,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:52,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:52,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:52,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:52,166 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 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 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:53,275 INFO L93 Difference]: Finished difference Result 852 states and 1556 transitions. [2025-01-08 23:59:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:53,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-01-08 23:59:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:53,284 INFO L225 Difference]: With dead ends: 852 [2025-01-08 23:59:53,284 INFO L226 Difference]: Without dead ends: 538 [2025-01-08 23:59:53,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:59:53,289 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 574 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:53,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 44 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:59:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-01-08 23:59:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-01-08 23:59:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4487895716945995) internal successors, (778), 537 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2025-01-08 23:59:53,336 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 30 [2025-01-08 23:59:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:53,337 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2025-01-08 23:59:53,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2025-01-08 23:59:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-08 23:59:53,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:53,341 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:53,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:59:53,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:53,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1683803296, now seen corresponding path program 1 times [2025-01-08 23:59:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022572277] [2025-01-08 23:59:53,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:53,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-08 23:59:53,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-08 23:59:53,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:53,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-08 23:59:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022572277] [2025-01-08 23:59:53,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022572277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:53,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:53,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:59:53,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013986104] [2025-01-08 23:59:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:53,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:53,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:53,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:53,563 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:54,084 INFO L93 Difference]: Finished difference Result 1074 states and 1656 transitions. [2025-01-08 23:59:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2025-01-08 23:59:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:54,087 INFO L225 Difference]: With dead ends: 1074 [2025-01-08 23:59:54,087 INFO L226 Difference]: Without dead ends: 716 [2025-01-08 23:59:54,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:59:54,089 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:54,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:59:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-08 23:59:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-01-08 23:59:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2025-01-08 23:59:54,111 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 178 [2025-01-08 23:59:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:54,111 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2025-01-08 23:59:54,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2025-01-08 23:59:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-08 23:59:54,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:54,114 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:54,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:59:54,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:54,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1237300178, now seen corresponding path program 1 times [2025-01-08 23:59:54,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:54,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516278213] [2025-01-08 23:59:54,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:54,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-08 23:59:54,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-08 23:59:54,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:54,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:59:54,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:54,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516278213] [2025-01-08 23:59:54,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516278213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:54,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:59:54,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:59:54,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447600551] [2025-01-08 23:59:54,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:54,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:59:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:54,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:59:54,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:54,390 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:55,019 INFO L93 Difference]: Finished difference Result 1637 states and 2268 transitions. [2025-01-08 23:59:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:59:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-01-08 23:59:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:55,028 INFO L225 Difference]: With dead ends: 1637 [2025-01-08 23:59:55,028 INFO L226 Difference]: Without dead ends: 1072 [2025-01-08 23:59:55,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:59:55,029 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 101 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:55,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 114 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:59:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-01-08 23:59:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2025-01-08 23:59:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.1724524076147815) internal successors, (1047), 893 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1047 transitions. [2025-01-08 23:59:55,049 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1047 transitions. Word has length 201 [2025-01-08 23:59:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:55,049 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1047 transitions. [2025-01-08 23:59:55,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1047 transitions. [2025-01-08 23:59:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-01-08 23:59:55,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:55,054 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:55,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:59:55,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:55,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1244949576, now seen corresponding path program 1 times [2025-01-08 23:59:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:55,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641204754] [2025-01-08 23:59:55,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:55,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:55,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-08 23:59:55,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-08 23:59:55,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:55,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 147 proven. 130 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-08 23:59:55,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:55,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641204754] [2025-01-08 23:59:55,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641204754] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:55,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944955433] [2025-01-08 23:59:55,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:55,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:55,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:55,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:59:55,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:59:55,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-08 23:59:55,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-08 23:59:55,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:55,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:55,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:55,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2025-01-08 23:59:55,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:55,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944955433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:55,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:55,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:59:55,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634668349] [2025-01-08 23:59:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:55,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:55,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:55,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:55,945 INFO L87 Difference]: Start difference. First operand 894 states and 1047 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:56,412 INFO L93 Difference]: Finished difference Result 2320 states and 2778 transitions. [2025-01-08 23:59:56,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:56,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2025-01-08 23:59:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:56,418 INFO L225 Difference]: With dead ends: 2320 [2025-01-08 23:59:56,418 INFO L226 Difference]: Without dead ends: 1606 [2025-01-08 23:59:56,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:56,419 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 151 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:56,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 265 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-01-08 23:59:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2025-01-08 23:59:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.1401541695865451) internal successors, (1627), 1427 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1627 transitions. [2025-01-08 23:59:56,437 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1627 transitions. Word has length 332 [2025-01-08 23:59:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:56,437 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1627 transitions. [2025-01-08 23:59:56,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1627 transitions. [2025-01-08 23:59:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-08 23:59:56,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:56,442 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-01-08 23:59:56,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:56,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:56,643 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:56,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash -291383975, now seen corresponding path program 1 times [2025-01-08 23:59:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:56,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011436144] [2025-01-08 23:59:56,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:56,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-08 23:59:56,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-08 23:59:56,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:56,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 407 proven. 130 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-01-08 23:59:57,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:57,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011436144] [2025-01-08 23:59:57,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011436144] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:57,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649809026] [2025-01-08 23:59:57,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:57,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:57,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:57,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:59:57,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:59:57,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-08 23:59:57,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-08 23:59:57,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:57,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:57,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:57,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-01-08 23:59:57,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:57,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649809026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:57,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:57,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:59:57,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575118624] [2025-01-08 23:59:57,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:57,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:57,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:57,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:57,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:57,482 INFO L87 Difference]: Start difference. First operand 1428 states and 1627 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:57,930 INFO L93 Difference]: Finished difference Result 3388 states and 3938 transitions. [2025-01-08 23:59:57,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:57,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 431 [2025-01-08 23:59:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:57,936 INFO L225 Difference]: With dead ends: 3388 [2025-01-08 23:59:57,936 INFO L226 Difference]: Without dead ends: 2140 [2025-01-08 23:59:57,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:57,938 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 151 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:57,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 262 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-01-08 23:59:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2025-01-08 23:59:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.1310555838857725) internal successors, (2218), 1961 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2218 transitions. [2025-01-08 23:59:57,962 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2218 transitions. Word has length 431 [2025-01-08 23:59:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:57,963 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2218 transitions. [2025-01-08 23:59:57,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2218 transitions. [2025-01-08 23:59:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-01-08 23:59:57,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:57,967 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:57,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:59:58,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:58,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:58,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 394907929, now seen corresponding path program 1 times [2025-01-08 23:59:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:58,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54870986] [2025-01-08 23:59:58,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:58,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-08 23:59:58,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-08 23:59:58,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:58,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 464 proven. 130 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-01-08 23:59:58,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:59:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54870986] [2025-01-08 23:59:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54870986] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:59:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089389822] [2025-01-08 23:59:58,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:58,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:58,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:59:58,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:59:58,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:59:58,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-08 23:59:58,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-08 23:59:58,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:58,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:59:58,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:59:58,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:59:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2025-01-08 23:59:58,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:59:58,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089389822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:59:58,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:59:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:59:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051920902] [2025-01-08 23:59:58,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:59:58,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:59:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:59:58,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:59:58,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:58,938 INFO L87 Difference]: Start difference. First operand 1962 states and 2218 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:59:59,387 INFO L93 Difference]: Finished difference Result 4278 states and 4939 transitions. [2025-01-08 23:59:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:59:59,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 450 [2025-01-08 23:59:59,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:59:59,394 INFO L225 Difference]: With dead ends: 4278 [2025-01-08 23:59:59,394 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:59:59,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:59:59,397 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 152 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:59:59,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 55 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:59:59,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:59:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2025-01-08 23:59:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.1514889943892965) internal successors, (2668), 2317 states have internal predecessors, (2668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2668 transitions. [2025-01-08 23:59:59,436 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2668 transitions. Word has length 450 [2025-01-08 23:59:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:59:59,436 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2668 transitions. [2025-01-08 23:59:59,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:59:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2668 transitions. [2025-01-08 23:59:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-08 23:59:59,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:59:59,442 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:59:59,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:59:59,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:59:59,646 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:59:59,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:59:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1061611690, now seen corresponding path program 1 times [2025-01-08 23:59:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:59:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569761996] [2025-01-08 23:59:59,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:59:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:59:59,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-08 23:59:59,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-08 23:59:59,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:59:59,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 479 proven. 130 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-01-09 00:00:00,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:00,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569761996] [2025-01-09 00:00:00,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569761996] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:00,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308836723] [2025-01-09 00:00:00,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:00,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:00,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:00,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:00:00,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:00:00,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-09 00:00:00,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-09 00:00:00,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:00,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:00,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:00:00,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-01-09 00:00:00,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:00,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308836723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:00,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:00,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 00:00:00,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652086809] [2025-01-09 00:00:00,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:00,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:00,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:00,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:00,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:00,695 INFO L87 Difference]: Start difference. First operand 2318 states and 2668 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:01,098 INFO L93 Difference]: Finished difference Result 5168 states and 5975 transitions. [2025-01-09 00:00:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:01,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 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 456 [2025-01-09 00:00:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:01,108 INFO L225 Difference]: With dead ends: 5168 [2025-01-09 00:00:01,108 INFO L226 Difference]: Without dead ends: 3030 [2025-01-09 00:00:01,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:01,111 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:01,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 55 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2025-01-09 00:00:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3030. [2025-01-09 00:00:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 1.1436117530538132) internal successors, (3464), 3029 states have internal predecessors, (3464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3464 transitions. [2025-01-09 00:00:01,159 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3464 transitions. Word has length 456 [2025-01-09 00:00:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:01,159 INFO L471 AbstractCegarLoop]: Abstraction has 3030 states and 3464 transitions. [2025-01-09 00:00:01,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3464 transitions. [2025-01-09 00:00:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-01-09 00:00:01,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:01,166 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:01,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 00:00:01,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 00:00:01,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:01,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2093827577, now seen corresponding path program 1 times [2025-01-09 00:00:01,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:01,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112476130] [2025-01-09 00:00:01,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:01,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:01,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-01-09 00:00:01,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-01-09 00:00:01,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:01,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-01-09 00:00:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:01,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112476130] [2025-01-09 00:00:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112476130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:01,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:01,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014923807] [2025-01-09 00:00:01,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:01,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:01,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:01,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:01,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:01,917 INFO L87 Difference]: Start difference. First operand 3030 states and 3464 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:02,381 INFO L93 Difference]: Finished difference Result 6414 states and 7403 transitions. [2025-01-09 00:00:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 525 [2025-01-09 00:00:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:02,391 INFO L225 Difference]: With dead ends: 6414 [2025-01-09 00:00:02,392 INFO L226 Difference]: Without dead ends: 3564 [2025-01-09 00:00:02,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:02,395 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:02,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2025-01-09 00:00:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3386. [2025-01-09 00:00:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.1400295420974889) internal successors, (3859), 3385 states have internal predecessors, (3859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3859 transitions. [2025-01-09 00:00:02,449 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3859 transitions. Word has length 525 [2025-01-09 00:00:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:02,450 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3859 transitions. [2025-01-09 00:00:02,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3859 transitions. [2025-01-09 00:00:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 00:00:02,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:02,458 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:02,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:00:02,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:02,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1802204610, now seen corresponding path program 1 times [2025-01-09 00:00:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:02,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402880046] [2025-01-09 00:00:02,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:02,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:02,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 00:00:02,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 00:00:02,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:02,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 720 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-01-09 00:00:02,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:02,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402880046] [2025-01-09 00:00:02,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402880046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:02,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:02,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146509846] [2025-01-09 00:00:02,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:02,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:00:02,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:02,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:00:02,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:00:02,723 INFO L87 Difference]: Start difference. First operand 3386 states and 3859 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:03,207 INFO L93 Difference]: Finished difference Result 6799 states and 7760 transitions. [2025-01-09 00:00:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:03,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 536 [2025-01-09 00:00:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:03,217 INFO L225 Difference]: With dead ends: 6799 [2025-01-09 00:00:03,217 INFO L226 Difference]: Without dead ends: 3564 [2025-01-09 00:00:03,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:00:03,222 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:03,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2025-01-09 00:00:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3386. [2025-01-09 00:00:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0954209748892172) internal successors, (3708), 3385 states have internal predecessors, (3708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3708 transitions. [2025-01-09 00:00:03,269 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3708 transitions. Word has length 536 [2025-01-09 00:00:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:03,270 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3708 transitions. [2025-01-09 00:00:03,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3708 transitions. [2025-01-09 00:00:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-01-09 00:00:03,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:03,277 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:03,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:00:03,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:03,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2010999627, now seen corresponding path program 1 times [2025-01-09 00:00:03,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:03,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974403845] [2025-01-09 00:00:03,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:03,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 00:00:03,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 00:00:03,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:03,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 699 proven. 23 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-01-09 00:00:03,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:03,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974403845] [2025-01-09 00:00:03,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974403845] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:03,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223604817] [2025-01-09 00:00:03,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:03,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:03,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:03,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:00:03,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:00:03,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 00:00:03,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 00:00:03,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:03,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:03,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:00:03,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-01-09 00:00:04,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:04,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223604817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:04,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:04,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:00:04,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080129102] [2025-01-09 00:00:04,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:04,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:00:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:04,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:00:04,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:04,325 INFO L87 Difference]: Start difference. First operand 3386 states and 3708 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:04,994 INFO L93 Difference]: Finished difference Result 7126 states and 7813 transitions. [2025-01-09 00:00:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:04,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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 549 [2025-01-09 00:00:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:05,015 INFO L225 Difference]: With dead ends: 7126 [2025-01-09 00:00:05,016 INFO L226 Difference]: Without dead ends: 3742 [2025-01-09 00:00:05,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:05,024 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 186 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:05,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 46 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:00:05,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-01-09 00:00:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2025-01-09 00:00:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.0926185798484422) internal successors, (3893), 3563 states have internal predecessors, (3893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3893 transitions. [2025-01-09 00:00:05,150 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3893 transitions. Word has length 549 [2025-01-09 00:00:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:05,150 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3893 transitions. [2025-01-09 00:00:05,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3893 transitions. [2025-01-09 00:00:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-01-09 00:00:05,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:05,159 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:05,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 00:00:05,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 00:00:05,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:05,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1515209828, now seen corresponding path program 1 times [2025-01-09 00:00:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:05,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339126026] [2025-01-09 00:00:05,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:05,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-01-09 00:00:05,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-01-09 00:00:05,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:05,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 1090 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-01-09 00:00:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:06,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339126026] [2025-01-09 00:00:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339126026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:06,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:06,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:06,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348689207] [2025-01-09 00:00:06,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:06,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:06,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:06,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:06,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:06,054 INFO L87 Difference]: Start difference. First operand 3564 states and 3893 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:06,483 INFO L93 Difference]: Finished difference Result 7838 states and 8583 transitions. [2025-01-09 00:00:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 638 [2025-01-09 00:00:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:06,494 INFO L225 Difference]: With dead ends: 7838 [2025-01-09 00:00:06,494 INFO L226 Difference]: Without dead ends: 4454 [2025-01-09 00:00:06,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:06,499 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:06,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 241 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-09 00:00:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3742. [2025-01-09 00:00:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0895482491312483) internal successors, (4076), 3741 states have internal predecessors, (4076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4076 transitions. [2025-01-09 00:00:06,551 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4076 transitions. Word has length 638 [2025-01-09 00:00:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:06,551 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 4076 transitions. [2025-01-09 00:00:06,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4076 transitions. [2025-01-09 00:00:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-01-09 00:00:06,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:06,556 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2025-01-09 00:00:06,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:00:06,556 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:06,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2064874640, now seen corresponding path program 1 times [2025-01-09 00:00:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:06,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890118586] [2025-01-09 00:00:06,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:06,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:06,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-01-09 00:00:06,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-01-09 00:00:06,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:06,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 962 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-01-09 00:00:06,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890118586] [2025-01-09 00:00:06,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890118586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:06,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:06,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:00:06,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603975065] [2025-01-09 00:00:06,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:06,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 00:00:06,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:06,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 00:00:06,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:06,990 INFO L87 Difference]: Start difference. First operand 3742 states and 4076 transitions. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:07,570 INFO L93 Difference]: Finished difference Result 7354 states and 8021 transitions. [2025-01-09 00:00:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 00:00:07,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 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 683 [2025-01-09 00:00:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:07,585 INFO L225 Difference]: With dead ends: 7354 [2025-01-09 00:00:07,587 INFO L226 Difference]: Without dead ends: 3742 [2025-01-09 00:00:07,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:07,592 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:07,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 28 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:00:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-01-09 00:00:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2025-01-09 00:00:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0708366746859128) internal successors, (4006), 3741 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4006 transitions. [2025-01-09 00:00:07,638 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4006 transitions. Word has length 683 [2025-01-09 00:00:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:07,639 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 4006 transitions. [2025-01-09 00:00:07,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4006 transitions. [2025-01-09 00:00:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2025-01-09 00:00:07,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:07,645 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:00:07,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:00:07,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:07,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash 778017581, now seen corresponding path program 1 times [2025-01-09 00:00:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:07,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938949253] [2025-01-09 00:00:07,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:07,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:07,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 855 statements into 1 equivalence classes. [2025-01-09 00:00:07,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 855 of 855 statements. [2025-01-09 00:00:07,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:07,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 1434 proven. 155 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-01-09 00:00:08,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:08,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938949253] [2025-01-09 00:00:08,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938949253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:08,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087853576] [2025-01-09 00:00:08,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:08,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:08,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:08,076 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:00:08,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:00:08,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 855 statements into 1 equivalence classes. [2025-01-09 00:00:08,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 855 of 855 statements. [2025-01-09 00:00:08,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:08,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:08,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:00:08,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2025-01-09 00:00:08,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:08,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087853576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:08,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:08,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:00:08,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761256911] [2025-01-09 00:00:08,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:08,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:08,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:08,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:08,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:00:08,333 INFO L87 Difference]: Start difference. First operand 3742 states and 4006 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:08,765 INFO L93 Difference]: Finished difference Result 8728 states and 9370 transitions. [2025-01-09 00:00:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:08,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 855 [2025-01-09 00:00:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:08,793 INFO L225 Difference]: With dead ends: 8728 [2025-01-09 00:00:08,796 INFO L226 Difference]: Without dead ends: 5166 [2025-01-09 00:00:08,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:00:08,802 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 155 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:08,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 50 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-01-09 00:00:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4454. [2025-01-09 00:00:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.073433640242533) internal successors, (4780), 4453 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4780 transitions. [2025-01-09 00:00:08,884 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4780 transitions. Word has length 855 [2025-01-09 00:00:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:08,888 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4780 transitions. [2025-01-09 00:00:08,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4780 transitions. [2025-01-09 00:00:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2025-01-09 00:00:08,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:08,903 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:08,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 00:00:09,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 00:00:09,104 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:09,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash -559096884, now seen corresponding path program 1 times [2025-01-09 00:00:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:09,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198174289] [2025-01-09 00:00:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:09,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 956 statements into 1 equivalence classes. [2025-01-09 00:00:09,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 956 of 956 statements. [2025-01-09 00:00:09,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:09,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 1940 proven. 0 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2025-01-09 00:00:09,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:09,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198174289] [2025-01-09 00:00:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198174289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:09,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:09,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:09,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457798959] [2025-01-09 00:00:09,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:09,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:09,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:09,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:09,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:09,748 INFO L87 Difference]: Start difference. First operand 4454 states and 4780 transitions. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:10,130 INFO L93 Difference]: Finished difference Result 9440 states and 10133 transitions. [2025-01-09 00:00:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:10,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 956 [2025-01-09 00:00:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:10,138 INFO L225 Difference]: With dead ends: 9440 [2025-01-09 00:00:10,138 INFO L226 Difference]: Without dead ends: 5166 [2025-01-09 00:00:10,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:10,142 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:10,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-01-09 00:00:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988. [2025-01-09 00:00:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0699819530780028) internal successors, (5336), 4987 states have internal predecessors, (5336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5336 transitions. [2025-01-09 00:00:10,238 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5336 transitions. Word has length 956 [2025-01-09 00:00:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:10,242 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5336 transitions. [2025-01-09 00:00:10,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5336 transitions. [2025-01-09 00:00:10,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2025-01-09 00:00:10,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:10,260 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:10,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:00:10,260 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:10,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash -785983439, now seen corresponding path program 1 times [2025-01-09 00:00:10,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:10,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116812437] [2025-01-09 00:00:10,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:10,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:10,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1033 statements into 1 equivalence classes. [2025-01-09 00:00:10,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1033 of 1033 statements. [2025-01-09 00:00:10,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:10,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3475 backedges. 1006 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2025-01-09 00:00:11,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:11,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116812437] [2025-01-09 00:00:11,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116812437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:11,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:11,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:11,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201173102] [2025-01-09 00:00:11,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:11,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:11,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:11,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:11,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:11,033 INFO L87 Difference]: Start difference. First operand 4988 states and 5336 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:11,492 INFO L93 Difference]: Finished difference Result 10508 states and 11271 transitions. [2025-01-09 00:00:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:11,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 1033 [2025-01-09 00:00:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:11,512 INFO L225 Difference]: With dead ends: 10508 [2025-01-09 00:00:11,515 INFO L226 Difference]: Without dead ends: 5344 [2025-01-09 00:00:11,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:11,522 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:11,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 229 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:00:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-01-09 00:00:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4454. [2025-01-09 00:00:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0529979788906356) internal successors, (4689), 4453 states have internal predecessors, (4689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4689 transitions. [2025-01-09 00:00:11,637 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4689 transitions. Word has length 1033 [2025-01-09 00:00:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:11,637 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4689 transitions. [2025-01-09 00:00:11,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4689 transitions. [2025-01-09 00:00:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2025-01-09 00:00:11,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:11,655 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:11,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:00:11,656 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:11,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1869461060, now seen corresponding path program 1 times [2025-01-09 00:00:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:11,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802406987] [2025-01-09 00:00:11,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:11,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1072 statements into 1 equivalence classes. [2025-01-09 00:00:11,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1072 of 1072 statements. [2025-01-09 00:00:11,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:11,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3686 backedges. 1717 proven. 21 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2025-01-09 00:00:13,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:13,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802406987] [2025-01-09 00:00:13,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802406987] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:13,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53233912] [2025-01-09 00:00:13,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:13,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:13,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:13,024 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:00:13,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 00:00:13,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1072 statements into 1 equivalence classes. [2025-01-09 00:00:13,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1072 of 1072 statements. [2025-01-09 00:00:13,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:13,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:13,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:00:13,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3686 backedges. 1038 proven. 0 refuted. 0 times theorem prover too weak. 2648 trivial. 0 not checked. [2025-01-09 00:00:13,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:13,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53233912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:13,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:13,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:00:13,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463188691] [2025-01-09 00:00:13,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:13,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:13,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:13,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:13,408 INFO L87 Difference]: Start difference. First operand 4454 states and 4689 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:13,780 INFO L93 Difference]: Finished difference Result 9084 states and 9567 transitions. [2025-01-09 00:00:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:13,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 1072 [2025-01-09 00:00:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:13,788 INFO L225 Difference]: With dead ends: 9084 [2025-01-09 00:00:13,788 INFO L226 Difference]: Without dead ends: 4810 [2025-01-09 00:00:13,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 1071 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:00:13,793 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 74 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:13,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 54 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 00:00:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-01-09 00:00:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2025-01-09 00:00:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0513927877348306) internal successors, (4869), 4631 states have internal predecessors, (4869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4869 transitions. [2025-01-09 00:00:13,833 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4869 transitions. Word has length 1072 [2025-01-09 00:00:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:13,834 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4869 transitions. [2025-01-09 00:00:13,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4869 transitions. [2025-01-09 00:00:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1137 [2025-01-09 00:00:13,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:13,843 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:13,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 00:00:14,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:14,044 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:14,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:14,044 INFO L85 PathProgramCache]: Analyzing trace with hash -788423964, now seen corresponding path program 1 times [2025-01-09 00:00:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:14,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907785219] [2025-01-09 00:00:14,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:14,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:14,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1136 statements into 1 equivalence classes. [2025-01-09 00:00:14,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1136 of 1136 statements. [2025-01-09 00:00:14,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:14,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3806 backedges. 2762 proven. 72 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2025-01-09 00:00:15,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:15,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907785219] [2025-01-09 00:00:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907785219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:15,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888279012] [2025-01-09 00:00:15,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:15,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:15,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:15,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:00:15,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 00:00:15,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1136 statements into 1 equivalence classes. [2025-01-09 00:00:15,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1136 of 1136 statements. [2025-01-09 00:00:15,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:15,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:15,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 00:00:15,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3806 backedges. 2671 proven. 716 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-01-09 00:00:16,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:00:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3806 backedges. 2834 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2025-01-09 00:00:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888279012] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:17,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:00:17,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-01-09 00:00:17,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382093498] [2025-01-09 00:00:17,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:17,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:00:17,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:17,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:00:17,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:00:17,385 INFO L87 Difference]: Start difference. First operand 4632 states and 4869 transitions. Second operand has 5 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:17,901 INFO L93 Difference]: Finished difference Result 9618 states and 10107 transitions. [2025-01-09 00:00:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:17,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 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 1136 [2025-01-09 00:00:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:17,910 INFO L225 Difference]: With dead ends: 9618 [2025-01-09 00:00:17,910 INFO L226 Difference]: Without dead ends: 5166 [2025-01-09 00:00:17,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2275 GetRequests, 2267 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:00:17,915 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 58 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:17,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 10 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:00:17,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-01-09 00:00:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2025-01-09 00:00:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0465793304221251) internal successors, (5033), 4809 states have internal predecessors, (5033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5033 transitions. [2025-01-09 00:00:18,041 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5033 transitions. Word has length 1136 [2025-01-09 00:00:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:18,042 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5033 transitions. [2025-01-09 00:00:18,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5033 transitions. [2025-01-09 00:00:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1273 [2025-01-09 00:00:18,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:18,066 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:18,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 00:00:18,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 00:00:18,271 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:18,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 28519556, now seen corresponding path program 1 times [2025-01-09 00:00:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844844656] [2025-01-09 00:00:18,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:18,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1272 statements into 1 equivalence classes. [2025-01-09 00:00:18,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1272 of 1272 statements. [2025-01-09 00:00:18,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:18,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4821 backedges. 2710 proven. 0 refuted. 0 times theorem prover too weak. 2111 trivial. 0 not checked. [2025-01-09 00:00:19,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:19,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844844656] [2025-01-09 00:00:19,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844844656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:19,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:19,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365905691] [2025-01-09 00:00:19,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:19,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:19,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:19,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:19,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:19,235 INFO L87 Difference]: Start difference. First operand 4810 states and 5033 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:19,604 INFO L93 Difference]: Finished difference Result 9796 states and 10249 transitions. [2025-01-09 00:00:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:19,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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 1272 [2025-01-09 00:00:19,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:19,611 INFO L225 Difference]: With dead ends: 9796 [2025-01-09 00:00:19,611 INFO L226 Difference]: Without dead ends: 4988 [2025-01-09 00:00:19,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:19,615 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:19,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 227 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 00:00:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-09 00:00:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2025-01-09 00:00:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0347657093500324) internal successors, (4792), 4631 states have internal predecessors, (4792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4792 transitions. [2025-01-09 00:00:19,649 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4792 transitions. Word has length 1272 [2025-01-09 00:00:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:19,649 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4792 transitions. [2025-01-09 00:00:19,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4792 transitions. [2025-01-09 00:00:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1387 [2025-01-09 00:00:19,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:19,658 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:00:19,659 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1741108147, now seen corresponding path program 1 times [2025-01-09 00:00:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204995596] [2025-01-09 00:00:19,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:19,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1386 statements into 1 equivalence classes. [2025-01-09 00:00:19,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1386 of 1386 statements. [2025-01-09 00:00:19,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:19,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:00:19,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 00:00:19,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1386 statements into 1 equivalence classes. [2025-01-09 00:00:19,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1386 of 1386 statements. [2025-01-09 00:00:19,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:19,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:00:20,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 00:00:20,262 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 00:00:20,264 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:00:20,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:00:20,269 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:20,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:00:20,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:00:20 BoogieIcfgContainer [2025-01-09 00:00:20,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:00:20,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:00:20,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:00:20,546 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:00:20,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:59:51" (3/4) ... [2025-01-09 00:00:20,547 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 00:00:20,987 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1384. [2025-01-09 00:00:21,506 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:00:21,507 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:00:21,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:00:21,512 INFO L158 Benchmark]: Toolchain (without parser) took 31269.54ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 106.6MB in the beginning and 189.0MB in the end (delta: -82.4MB). Peak memory consumption was 710.3MB. Max. memory is 16.1GB. [2025-01-09 00:00:21,512 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:00:21,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.37ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 74.3MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 00:00:21,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.95ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 64.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:00:21,512 INFO L158 Benchmark]: Boogie Preprocessor took 87.35ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 52.2MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 00:00:21,513 INFO L158 Benchmark]: RCFGBuilder took 972.91ms. Allocated memory is still 142.6MB. Free memory was 52.2MB in the beginning and 65.9MB in the end (delta: -13.7MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2025-01-09 00:00:21,513 INFO L158 Benchmark]: TraceAbstraction took 28800.98ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 65.0MB in the beginning and 476.5MB in the end (delta: -411.6MB). Peak memory consumption was 586.3MB. Max. memory is 16.1GB. [2025-01-09 00:00:21,513 INFO L158 Benchmark]: Witness Printer took 961.48ms. Allocated memory was 1.1GB in the beginning and 285.2MB in the end (delta: -855.6MB). Free memory was 472.3MB in the beginning and 189.0MB in the end (delta: 283.3MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2025-01-09 00:00:21,519 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.37ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 74.3MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.95ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 64.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.35ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 52.2MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 972.91ms. Allocated memory is still 142.6MB. Free memory was 52.2MB in the beginning and 65.9MB in the end (delta: -13.7MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * TraceAbstraction took 28800.98ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 65.0MB in the beginning and 476.5MB in the end (delta: -411.6MB). Peak memory consumption was 586.3MB. Max. memory is 16.1GB. * Witness Printer took 961.48ms. Allocated memory was 1.1GB in the beginning and 285.2MB in the end (delta: -855.6MB). Free memory was 472.3MB in the beginning and 189.0MB in the end (delta: 283.3MB). Peak memory consumption was 74.7MB. 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: 104]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputD = 4; [L18] int inputB = 2; [L19] int inputC = 3; [L20] int inputF = 6; [L21] int inputE = 5; [L22] int inputA = 1; [L25] int a21 = 7; [L26] int a15 = 8; [L27] int a12 = -49; [L28] int a24 = 1; VAL [a12=-49, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L887] int output = -1; VAL [a12=-49, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L461] a21 = 10 [L463] return 22; VAL [\result=22, a12=-49, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND TRUE ((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8)) [L455] a12 = ((((a12 % 26)+ -1) / 5) / 5) [L456] a21 = 7 [L458] return 25; VAL [\result=25, a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND TRUE (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8)) [L502] a21 = 9 [L504] return 21; VAL [\result=21, a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND TRUE (((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1)) [L287] a21 = 10 [L289] return 24; VAL [\result=24, a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L636] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L648] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L660] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L666] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L684] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L687] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L693] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L710] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L734] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L740] COND FALSE !(((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((a15==8) && (( ((-43 < a12) && (11 >= a12)) && ((a21==9) && (input == 4))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !((( a12 <= -43 && ((((a21==10) || ((a21==8) || (a21==9))) && (input == 4)) && (a15==8))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a24==1) && ((a15==8) && ((input == 4) && (( 80 < a12 && (a21==7)) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L762] COND FALSE !(( ((11 < a12) && (80 >= a12)) && ((a15==8) && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L768] COND FALSE !(((((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9)))) && (input == 4)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !((((a15==8) && (((( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6))) || ( 80 < a12 && (a21==7))) && (input == 5))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !(((a21==9) && ((((input == 6) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L793] COND FALSE !(((a24==1) && ((a21==9) && ( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (input == 3)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a15==9) && (((input == 3) && (((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L805] COND FALSE !(( a12 <= -43 && ((a21==7) && ((a24==1) && ((a15==8) && (input == 6)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L811] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((((input == 3) && (a24==1)) && (a21==8)) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((((a24==2) && a12 <= -43 ) && (a15==5)) && (a21==6))) && (input == 5))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((a21==7) || (a21==8)) && (input == 5)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L829] COND FALSE !(((((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 1)) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 6)) && (a15==9))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(((a24==1) && (((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))) && (input == 1)) && (a15==8)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND TRUE (((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 5))) && (a24==1)) [L848] a12 = (((((a12 - -338613) - -126296) * 1) % 34)- -42) [L849] a21 = 9 [L851] return 25; VAL [\result=25, a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND TRUE (((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) [L258] a12 = (((a12 - -334333) + 32000) / 5) [L259] a21 = 8 [L261] return 22; VAL [\result=22, a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L636] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L648] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L660] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L666] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L684] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L687] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L693] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L710] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L734] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L740] COND FALSE !(((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((a15==8) && (( ((-43 < a12) && (11 >= a12)) && ((a21==9) && (input == 4))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !((( a12 <= -43 && ((((a21==10) || ((a21==8) || (a21==9))) && (input == 4)) && (a15==8))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a24==1) && ((a15==8) && ((input == 4) && (( 80 < a12 && (a21==7)) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L762] COND FALSE !(( ((11 < a12) && (80 >= a12)) && ((a15==8) && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L768] COND FALSE !(((((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9)))) && (input == 4)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !((((a15==8) && (((( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6))) || ( 80 < a12 && (a21==7))) && (input == 5))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !(((a21==9) && ((((input == 6) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L793] COND FALSE !(((a24==1) && ((a21==9) && ( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (input == 3)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a15==9) && (((input == 3) && (((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L805] COND FALSE !(( a12 <= -43 && ((a21==7) && ((a24==1) && ((a15==8) && (input == 6)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L811] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((((input == 3) && (a24==1)) && (a21==8)) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((((a24==2) && a12 <= -43 ) && (a15==5)) && (a21==6))) && (input == 5))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((a21==7) || (a21==8)) && (input == 5)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L829] COND FALSE !(((((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 1)) && (a15==8)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 6)) && (a15==9))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(((a24==1) && (((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))) && (input == 1)) && (a15==8)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 5))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L852] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 6) && ((a21==9) || (a21==10))) && (a24==1))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L858] COND TRUE ((a15==8) && ( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 5))))) [L859] a12 = (((a12 + -600079) - -316691) - 316661) [L860] a15 = 9 [L861] a21 = 8 [L863] return 26; VAL [\result=26, a12=-526769, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND TRUE (((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9)) [L507] a21 = 10 [L509] return 22; VAL [\result=22, a12=-526769, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND TRUE ((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1)) [L632] a12 = (((((a12 % 26)- 16) + 343661) - 46416) - 297244) [L633] a21 = 8 [L635] return 25; VAL [\result=25, a12=-24, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L636] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L648] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L660] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L666] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L684] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L687] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L693] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L710] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L734] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L740] COND FALSE !(((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((a15==8) && (( ((-43 < a12) && (11 >= a12)) && ((a21==9) && (input == 4))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !((( a12 <= -43 && ((((a21==10) || ((a21==8) || (a21==9))) && (input == 4)) && (a15==8))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a24==1) && ((a15==8) && ((input == 4) && (( 80 < a12 && (a21==7)) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L762] COND FALSE !(( ((11 < a12) && (80 >= a12)) && ((a15==8) && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L768] COND FALSE !(((((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9)))) && (input == 4)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !((((a15==8) && (((( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6))) || ( 80 < a12 && (a21==7))) && (input == 5))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !(((a21==9) && ((((input == 6) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L793] COND FALSE !(((a24==1) && ((a21==9) && ( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (input == 3)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a15==9) && (((input == 3) && (((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L805] COND FALSE !(( a12 <= -43 && ((a21==7) && ((a24==1) && ((a15==8) && (input == 6)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L811] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((((input == 3) && (a24==1)) && (a21==8)) && (a15==9)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((((a24==2) && a12 <= -43 ) && (a15==5)) && (a21==6))) && (input == 5))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((a21==7) || (a21==8)) && (input == 5)))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L829] COND FALSE !(((((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 1)) && (a15==8)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 6)) && (a15==9))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(((a24==1) && (((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))) && (input == 1)) && (a15==8)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 5))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L852] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 6) && ((a21==9) || (a21==10))) && (a24==1))) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L858] COND FALSE !(((a15==8) && ( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 5)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L864] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 5)))) && 80 < a12 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !((((((input == 5) && ((-43 < a12) && (11 >= a12)) ) && (a21==8)) && (a24==1)) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND TRUE ((a15==9) && ((((input == 4) && (a24==1)) && (a21==8)) && ((-43 < a12) && (11 >= a12)) )) [L877] a21 = 10 [L879] return 22; VAL [\result=22, a12=-24, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=-24, a15=9, a21=10, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND TRUE (((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1)) [L465] a12 = (((a12 / 5) + 176111) * 3) [L466] a15 = 7 [L467] a21 = 9 [L469] return -1; VAL [\result=-1, a12=528321, a15=7, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND TRUE ((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9)) VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] reach_error() VAL [a12=528321, a15=7, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 19, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2347 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2347 mSDsluCounter, 1887 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 1387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9508 IncrementalHoareTripleChecker+Invalid, 10895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1387 mSolverCounterUnsat, 1775 mSDtfsCounter, 9508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6479 GetRequests, 6420 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=14, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 4628 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 18000 NumberOfCodeBlocks, 18000 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 17723 ConstructedInterpolants, 0 QuantifiedInterpolants, 49944 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6629 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 44918/46425 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 00:00:21,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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