./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91a1582c95113cfba0e714447513a3bab5b2cf717d4617c1de8d26d5cf0d5e1d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:16:49,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:16:49,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:16:49,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:16:49,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:16:49,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:16:49,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:16:49,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:16:49,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:16:49,243 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:16:49,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:16:49,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:16:49,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:16:49,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:16:49,248 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:16:49,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:16:49,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:16:49,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:16:49,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:16:49,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:16:49,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:16:49,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:16:49,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:16:49,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:16:49,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:16:49,256 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:16:49,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:16:49,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:16:49,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:16:49,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:16:49,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:16:49,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:16:49,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:16:49,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:16:49,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:16:49,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:16:49,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:16:49,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:16:49,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:16:49,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:16:49,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:16:49,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:16:49,261 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 91a1582c95113cfba0e714447513a3bab5b2cf717d4617c1de8d26d5cf0d5e1d [2024-10-23 21:16:49,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:16:49,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:16:49,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:16:49,576 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:16:49,577 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:16:49,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label13.c [2024-10-23 21:16:51,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:16:51,386 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:16:51,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label13.c [2024-10-23 21:16:51,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513a66f54/3a1b586d133146e882c15b22b7856898/FLAG39a29bae6 [2024-10-23 21:16:51,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513a66f54/3a1b586d133146e882c15b22b7856898 [2024-10-23 21:16:51,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:16:51,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:16:51,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:16:51,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:16:51,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:16:51,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:16:51" (1/1) ... [2024-10-23 21:16:51,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cda5794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:51, skipping insertion in model container [2024-10-23 21:16:51,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:16:51" (1/1) ... [2024-10-23 21:16:51,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:16:51,967 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label13.c[2689,2702] [2024-10-23 21:16:52,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:16:52,169 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:16:52,183 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label13.c[2689,2702] [2024-10-23 21:16:52,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:16:52,318 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:16:52,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52 WrapperNode [2024-10-23 21:16:52,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:16:52,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:16:52,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:16:52,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:16:52,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,432 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-23 21:16:52,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:16:52,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:16:52,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:16:52,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:16:52,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,491 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 21:16:52,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:16:52,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:16:52,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:16:52,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:16:52,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (1/1) ... [2024-10-23 21:16:52,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:16:52,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:16:52,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 21:16:52,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 21:16:52,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:16:52,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:16:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:16:52,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:16:52,721 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:16:52,724 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:16:53,967 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-23 21:16:53,967 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:16:54,056 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:16:54,056 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:16:54,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:16:54 BoogieIcfgContainer [2024-10-23 21:16:54,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:16:54,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:16:54,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:16:54,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:16:54,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:16:51" (1/3) ... [2024-10-23 21:16:54,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610f137a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:16:54, skipping insertion in model container [2024-10-23 21:16:54,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:16:52" (2/3) ... [2024-10-23 21:16:54,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610f137a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:16:54, skipping insertion in model container [2024-10-23 21:16:54,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:16:54" (3/3) ... [2024-10-23 21:16:54,070 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label13.c [2024-10-23 21:16:54,090 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:16:54,090 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:16:54,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:16:54,178 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;@2b5d6c60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:16:54,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:16:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-23 21:16:54,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:16:54,189 INFO L215 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] [2024-10-23 21:16:54,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:16:54,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:16:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1774656129, now seen corresponding path program 1 times [2024-10-23 21:16:54,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:16:54,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358331362] [2024-10-23 21:16:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:16:54,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:16:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:16:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:16:54,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:16:54,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358331362] [2024-10-23 21:16:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358331362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:16:54,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:16:54,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:16:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931446563] [2024-10-23 21:16:54,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:16:54,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:16:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:16:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:16:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:16:54,440 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:16:54,493 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-23 21:16:54,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:16:54,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-23 21:16:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:16:54,509 INFO L225 Difference]: With dead ends: 365 [2024-10-23 21:16:54,509 INFO L226 Difference]: Without dead ends: 181 [2024-10-23 21:16:54,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:16:54,519 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:16:54,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:16:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-23 21:16:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-23 21:16:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-23 21:16:54,580 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 23 [2024-10-23 21:16:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:16:54,581 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-23 21:16:54,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-23 21:16:54,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-23 21:16:54,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:16:54,583 INFO L215 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] [2024-10-23 21:16:54,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:16:54,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:16:54,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:16:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1370364903, now seen corresponding path program 1 times [2024-10-23 21:16:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:16:54,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20592486] [2024-10-23 21:16:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:16:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:16:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:16:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:16:54,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:16:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20592486] [2024-10-23 21:16:54,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20592486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:16:54,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:16:54,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:16:54,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145990916] [2024-10-23 21:16:54,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:16:54,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:16:54,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:16:54,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:16:54,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:16:54,765 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:16:55,678 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-10-23 21:16:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:16:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-23 21:16:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:16:55,681 INFO L225 Difference]: With dead ends: 539 [2024-10-23 21:16:55,682 INFO L226 Difference]: Without dead ends: 359 [2024-10-23 21:16:55,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:16:55,686 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 158 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:16:55,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 51 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 21:16:55,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-23 21:16:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-23 21:16:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.5223463687150838) internal successors, (545), 358 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2024-10-23 21:16:55,718 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 23 [2024-10-23 21:16:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:16:55,719 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2024-10-23 21:16:55,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2024-10-23 21:16:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-23 21:16:55,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:16:55,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:16:55,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:16:55,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:16:55,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:16:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash 354871930, now seen corresponding path program 1 times [2024-10-23 21:16:55,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:16:55,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062188526] [2024-10-23 21:16:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:16:55,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:16:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:16:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:16:56,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:16:56,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062188526] [2024-10-23 21:16:56,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062188526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:16:56,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:16:56,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:16:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626088846] [2024-10-23 21:16:56,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:16:56,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:16:56,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:16:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:16:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:16:56,007 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:16:56,809 INFO L93 Difference]: Finished difference Result 1073 states and 1632 transitions. [2024-10-23 21:16:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:16:56,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-23 21:16:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:16:56,813 INFO L225 Difference]: With dead ends: 1073 [2024-10-23 21:16:56,814 INFO L226 Difference]: Without dead ends: 715 [2024-10-23 21:16:56,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:16:56,817 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:16:56,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 93 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:16:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-23 21:16:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-23 21:16:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2024-10-23 21:16:56,848 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 98 [2024-10-23 21:16:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:16:56,850 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2024-10-23 21:16:56,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2024-10-23 21:16:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-23 21:16:56,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:16:56,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:16:56,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:16:56,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:16:56,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:16:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash -254520336, now seen corresponding path program 1 times [2024-10-23 21:16:56,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:16:56,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401607726] [2024-10-23 21:16:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:16:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:16:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:16:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:16:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:16:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401607726] [2024-10-23 21:16:57,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401607726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:16:57,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:16:57,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:16:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380247000] [2024-10-23 21:16:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:16:57,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:16:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:16:57,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:16:57,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:16:57,188 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:16:58,222 INFO L93 Difference]: Finished difference Result 1963 states and 2569 transitions. [2024-10-23 21:16:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:16:58,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-10-23 21:16:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:16:58,229 INFO L225 Difference]: With dead ends: 1963 [2024-10-23 21:16:58,229 INFO L226 Difference]: Without dead ends: 1249 [2024-10-23 21:16:58,231 INFO L431 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 [2024-10-23 21:16:58,232 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:16:58,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-23 21:16:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-23 21:16:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-10-23 21:16:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.236378205128205) internal successors, (1543), 1248 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1543 transitions. [2024-10-23 21:16:58,259 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1543 transitions. Word has length 102 [2024-10-23 21:16:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:16:58,259 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1543 transitions. [2024-10-23 21:16:58,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1543 transitions. [2024-10-23 21:16:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-23 21:16:58,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:16:58,267 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-23 21:16:58,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:16:58,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:16:58,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:16:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash -951031516, now seen corresponding path program 1 times [2024-10-23 21:16:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:16:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488125851] [2024-10-23 21:16:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:16:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:16:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:16:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:16:58,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:16:58,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488125851] [2024-10-23 21:16:58,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488125851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:16:58,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:16:58,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:16:58,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447043225] [2024-10-23 21:16:58,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:16:58,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:16:58,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:16:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:16:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:16:58,577 INFO L87 Difference]: Start difference. First operand 1249 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:16:59,359 INFO L93 Difference]: Finished difference Result 2704 states and 3352 transitions. [2024-10-23 21:16:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:16:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2024-10-23 21:16:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:16:59,367 INFO L225 Difference]: With dead ends: 2704 [2024-10-23 21:16:59,369 INFO L226 Difference]: Without dead ends: 1605 [2024-10-23 21:16:59,371 INFO L431 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 [2024-10-23 21:16:59,374 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 102 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:16:59,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 117 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:16:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-10-23 21:16:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2024-10-23 21:16:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1221945137157108) internal successors, (1800), 1604 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1800 transitions. [2024-10-23 21:16:59,409 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1800 transitions. Word has length 182 [2024-10-23 21:16:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:16:59,410 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1800 transitions. [2024-10-23 21:16:59,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:16:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1800 transitions. [2024-10-23 21:16:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-10-23 21:16:59,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:16:59,419 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:16:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:16:59,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:16:59,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:16:59,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1304011427, now seen corresponding path program 1 times [2024-10-23 21:16:59,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:16:59,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841984853] [2024-10-23 21:16:59,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:16:59,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:16:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:16:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 113 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-23 21:16:59,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:16:59,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841984853] [2024-10-23 21:16:59,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841984853] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:16:59,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426360104] [2024-10-23 21:16:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:16:59,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:16:59,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:16:59,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:16:59,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 21:17:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:00,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:17:00,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:17:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-23 21:17:00,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:17:00,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426360104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:00,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:17:00,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 21:17:00,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059297039] [2024-10-23 21:17:00,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:00,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:00,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:00,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:00,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:17:00,192 INFO L87 Difference]: Start difference. First operand 1605 states and 1800 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:00,796 INFO L93 Difference]: Finished difference Result 3387 states and 3900 transitions. [2024-10-23 21:17:00,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:00,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 309 [2024-10-23 21:17:00,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:00,804 INFO L225 Difference]: With dead ends: 3387 [2024-10-23 21:17:00,804 INFO L226 Difference]: Without dead ends: 1961 [2024-10-23 21:17:00,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:17:00,807 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 161 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:00,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 251 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:17:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-23 21:17:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1961. [2024-10-23 21:17:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.1321428571428571) internal successors, (2219), 1960 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2219 transitions. [2024-10-23 21:17:00,842 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2219 transitions. Word has length 309 [2024-10-23 21:17:00,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:00,843 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2219 transitions. [2024-10-23 21:17:00,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2219 transitions. [2024-10-23 21:17:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-10-23 21:17:00,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:00,848 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 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] [2024-10-23 21:17:00,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 21:17:01,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-23 21:17:01,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:01,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash 963222867, now seen corresponding path program 1 times [2024-10-23 21:17:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:01,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679470806] [2024-10-23 21:17:01,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:01,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-23 21:17:01,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:01,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679470806] [2024-10-23 21:17:01,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679470806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:01,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:17:01,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:17:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088225405] [2024-10-23 21:17:01,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:01,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:01,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:01,456 INFO L87 Difference]: Start difference. First operand 1961 states and 2219 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:01,965 INFO L93 Difference]: Finished difference Result 4099 states and 4688 transitions. [2024-10-23 21:17:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 313 [2024-10-23 21:17:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:01,974 INFO L225 Difference]: With dead ends: 4099 [2024-10-23 21:17:01,975 INFO L226 Difference]: Without dead ends: 2317 [2024-10-23 21:17:01,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:01,978 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:01,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 56 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:17:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-10-23 21:17:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2317. [2024-10-23 21:17:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.1278065630397236) internal successors, (2612), 2316 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2612 transitions. [2024-10-23 21:17:02,017 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2612 transitions. Word has length 313 [2024-10-23 21:17:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:02,017 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2612 transitions. [2024-10-23 21:17:02,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2612 transitions. [2024-10-23 21:17:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-10-23 21:17:02,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:02,022 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-23 21:17:02,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:17:02,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:02,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1794913867, now seen corresponding path program 1 times [2024-10-23 21:17:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:02,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129692938] [2024-10-23 21:17:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 120 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-23 21:17:02,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:02,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129692938] [2024-10-23 21:17:02,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129692938] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:17:02,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305485788] [2024-10-23 21:17:02,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:02,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:17:02,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:17:02,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:17:02,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 21:17:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:02,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:17:02,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:17:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-10-23 21:17:02,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:17:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305485788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:02,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:17:02,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-23 21:17:02,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133866934] [2024-10-23 21:17:02,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:02,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:02,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:02,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:17:02,967 INFO L87 Difference]: Start difference. First operand 2317 states and 2612 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:03,528 INFO L93 Difference]: Finished difference Result 4989 states and 5717 transitions. [2024-10-23 21:17:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:03,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 316 [2024-10-23 21:17:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:03,539 INFO L225 Difference]: With dead ends: 4989 [2024-10-23 21:17:03,539 INFO L226 Difference]: Without dead ends: 2851 [2024-10-23 21:17:03,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:17:03,543 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:03,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 45 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:17:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2024-10-23 21:17:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2673. [2024-10-23 21:17:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.1126497005988023) internal successors, (2973), 2672 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2973 transitions. [2024-10-23 21:17:03,591 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2973 transitions. Word has length 316 [2024-10-23 21:17:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:03,592 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2973 transitions. [2024-10-23 21:17:03,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2973 transitions. [2024-10-23 21:17:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-23 21:17:03,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:03,596 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-10-23 21:17:03,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 21:17:03,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-23 21:17:03,797 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:03,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash 977807247, now seen corresponding path program 1 times [2024-10-23 21:17:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008737510] [2024-10-23 21:17:03,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-23 21:17:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008737510] [2024-10-23 21:17:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008737510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:04,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:17:04,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:17:04,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378869926] [2024-10-23 21:17:04,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:04,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:04,029 INFO L87 Difference]: Start difference. First operand 2673 states and 2973 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:04,620 INFO L93 Difference]: Finished difference Result 5701 states and 6437 transitions. [2024-10-23 21:17:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:04,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2024-10-23 21:17:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:04,630 INFO L225 Difference]: With dead ends: 5701 [2024-10-23 21:17:04,631 INFO L226 Difference]: Without dead ends: 3207 [2024-10-23 21:17:04,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:04,635 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 162 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:04,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 65 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:17:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2024-10-23 21:17:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 2851. [2024-10-23 21:17:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 1.1164912280701755) internal successors, (3182), 2850 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3182 transitions. [2024-10-23 21:17:04,683 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3182 transitions. Word has length 340 [2024-10-23 21:17:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:04,684 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 3182 transitions. [2024-10-23 21:17:04,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:04,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3182 transitions. [2024-10-23 21:17:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-23 21:17:04,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:04,688 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:04,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:17:04,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:04,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1298971906, now seen corresponding path program 1 times [2024-10-23 21:17:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:04,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31395906] [2024-10-23 21:17:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:04,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-23 21:17:04,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:04,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31395906] [2024-10-23 21:17:04,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31395906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:04,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:17:04,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:17:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230045798] [2024-10-23 21:17:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:04,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:04,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:04,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:04,906 INFO L87 Difference]: Start difference. First operand 2851 states and 3182 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) [2024-10-23 21:17:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:05,474 INFO L93 Difference]: Finished difference Result 3921 states and 4447 transitions. [2024-10-23 21:17:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:05,475 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 347 [2024-10-23 21:17:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:05,488 INFO L225 Difference]: With dead ends: 3921 [2024-10-23 21:17:05,488 INFO L226 Difference]: Without dead ends: 3919 [2024-10-23 21:17:05,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:05,491 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 160 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:05,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 16 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:17:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-23 21:17:05,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3207. [2024-10-23 21:17:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.1384903306300687) internal successors, (3650), 3206 states have internal predecessors, (3650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3650 transitions. [2024-10-23 21:17:05,558 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3650 transitions. Word has length 347 [2024-10-23 21:17:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:05,559 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3650 transitions. [2024-10-23 21:17:05,559 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) [2024-10-23 21:17:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3650 transitions. [2024-10-23 21:17:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-10-23 21:17:05,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:05,565 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:05,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:17:05,565 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:05,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2041056121, now seen corresponding path program 1 times [2024-10-23 21:17:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374257877] [2024-10-23 21:17:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-10-23 21:17:05,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:05,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374257877] [2024-10-23 21:17:05,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374257877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:05,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:17:05,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:17:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624090007] [2024-10-23 21:17:05,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:05,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:17:05,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:17:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:17:05,942 INFO L87 Difference]: Start difference. First operand 3207 states and 3650 transitions. Second operand has 4 states, 4 states have (on average 52.75) 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) [2024-10-23 21:17:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:06,584 INFO L93 Difference]: Finished difference Result 6442 states and 7345 transitions. [2024-10-23 21:17:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:17:06,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) 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 393 [2024-10-23 21:17:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:06,595 INFO L225 Difference]: With dead ends: 6442 [2024-10-23 21:17:06,595 INFO L226 Difference]: Without dead ends: 3385 [2024-10-23 21:17:06,599 INFO L431 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 [2024-10-23 21:17:06,600 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:06,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 14 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:17:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2024-10-23 21:17:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3207. [2024-10-23 21:17:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0995009357454772) internal successors, (3525), 3206 states have internal predecessors, (3525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3525 transitions. [2024-10-23 21:17:06,653 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3525 transitions. Word has length 393 [2024-10-23 21:17:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:06,654 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3525 transitions. [2024-10-23 21:17:06,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) 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) [2024-10-23 21:17:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3525 transitions. [2024-10-23 21:17:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-10-23 21:17:06,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:06,660 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 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] [2024-10-23 21:17:06,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:17:06,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:06,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:06,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1846920008, now seen corresponding path program 2 times [2024-10-23 21:17:06,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:06,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623265383] [2024-10-23 21:17:06,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:06,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 337 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-23 21:17:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:07,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623265383] [2024-10-23 21:17:07,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623265383] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:17:07,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370011185] [2024-10-23 21:17:07,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-23 21:17:07,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:17:07,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:17:07,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:17:07,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 21:17:07,511 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-23 21:17:07,512 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-23 21:17:07,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 21:17:07,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:17:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-23 21:17:08,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:17:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370011185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:08,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:17:08,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 21:17:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054998436] [2024-10-23 21:17:08,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:08,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:17:08,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:17:08,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-23 21:17:08,162 INFO L87 Difference]: Start difference. First operand 3207 states and 3525 transitions. Second operand has 4 states, 4 states have (on average 52.75) 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) [2024-10-23 21:17:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:08,906 INFO L93 Difference]: Finished difference Result 7481 states and 8210 transitions. [2024-10-23 21:17:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:17:08,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) 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 419 [2024-10-23 21:17:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:08,924 INFO L225 Difference]: With dead ends: 7481 [2024-10-23 21:17:08,924 INFO L226 Difference]: Without dead ends: 4453 [2024-10-23 21:17:08,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-23 21:17:08,929 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 190 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:08,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 13 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:17:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2024-10-23 21:17:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 3207. [2024-10-23 21:17:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0814098565190269) internal successors, (3467), 3206 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3467 transitions. [2024-10-23 21:17:08,998 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3467 transitions. Word has length 419 [2024-10-23 21:17:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:08,998 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3467 transitions. [2024-10-23 21:17:08,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) 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) [2024-10-23 21:17:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3467 transitions. [2024-10-23 21:17:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-23 21:17:09,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:09,006 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:09,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 21:17:09,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:17:09,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:09,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1229818887, now seen corresponding path program 1 times [2024-10-23 21:17:09,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:09,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390448115] [2024-10-23 21:17:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:09,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-23 21:17:09,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:09,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390448115] [2024-10-23 21:17:09,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390448115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:09,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:17:09,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:17:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369112861] [2024-10-23 21:17:09,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:09,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:09,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:09,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:09,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:09,610 INFO L87 Difference]: Start difference. First operand 3207 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:10,038 INFO L93 Difference]: Finished difference Result 6947 states and 7542 transitions. [2024-10-23 21:17:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 426 [2024-10-23 21:17:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:10,059 INFO L225 Difference]: With dead ends: 6947 [2024-10-23 21:17:10,063 INFO L226 Difference]: Without dead ends: 3919 [2024-10-23 21:17:10,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:10,068 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 103 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:10,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 224 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:17:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-23 21:17:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3741. [2024-10-23 21:17:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0751336898395722) internal successors, (4021), 3740 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4021 transitions. [2024-10-23 21:17:10,134 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4021 transitions. Word has length 426 [2024-10-23 21:17:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:10,134 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4021 transitions. [2024-10-23 21:17:10,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4021 transitions. [2024-10-23 21:17:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-10-23 21:17:10,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:10,138 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:10,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:17:10,138 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1877783350, now seen corresponding path program 1 times [2024-10-23 21:17:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610466387] [2024-10-23 21:17:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 337 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-23 21:17:10,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:10,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610466387] [2024-10-23 21:17:10,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610466387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:17:10,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176506433] [2024-10-23 21:17:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:10,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:17:10,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:17:10,957 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:17:10,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 21:17:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:11,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:17:11,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:17:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-10-23 21:17:11,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:17:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176506433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:11,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:17:11,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 21:17:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24954269] [2024-10-23 21:17:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:11,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:11,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:11,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:11,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:17:11,158 INFO L87 Difference]: Start difference. First operand 3741 states and 4021 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:11,585 INFO L93 Difference]: Finished difference Result 5167 states and 5551 transitions. [2024-10-23 21:17:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 471 [2024-10-23 21:17:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:11,598 INFO L225 Difference]: With dead ends: 5167 [2024-10-23 21:17:11,599 INFO L226 Difference]: Without dead ends: 5165 [2024-10-23 21:17:11,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:17:11,601 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 177 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:11,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 9 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:17:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2024-10-23 21:17:11,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 3741. [2024-10-23 21:17:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0751336898395722) internal successors, (4021), 3740 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4021 transitions. [2024-10-23 21:17:11,661 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4021 transitions. Word has length 471 [2024-10-23 21:17:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:11,662 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4021 transitions. [2024-10-23 21:17:11,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4021 transitions. [2024-10-23 21:17:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2024-10-23 21:17:11,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:11,669 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:11,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-23 21:17:11,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:17:11,870 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:11,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash 791770339, now seen corresponding path program 1 times [2024-10-23 21:17:11,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:11,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413714990] [2024-10-23 21:17:11,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:11,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 809 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-10-23 21:17:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413714990] [2024-10-23 21:17:12,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413714990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:12,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:17:12,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:17:12,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921010315] [2024-10-23 21:17:12,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:12,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:12,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:12,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:12,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:12,206 INFO L87 Difference]: Start difference. First operand 3741 states and 4021 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:12,687 INFO L93 Difference]: Finished difference Result 8193 states and 8884 transitions. [2024-10-23 21:17:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:12,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 622 [2024-10-23 21:17:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:12,695 INFO L225 Difference]: With dead ends: 8193 [2024-10-23 21:17:12,695 INFO L226 Difference]: Without dead ends: 4809 [2024-10-23 21:17:12,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:12,700 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:12,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:17:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2024-10-23 21:17:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4631. [2024-10-23 21:17:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0734341252699784) internal successors, (4970), 4630 states have internal predecessors, (4970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4970 transitions. [2024-10-23 21:17:12,760 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4970 transitions. Word has length 622 [2024-10-23 21:17:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:12,761 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4970 transitions. [2024-10-23 21:17:12,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4970 transitions. [2024-10-23 21:17:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 745 [2024-10-23 21:17:12,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:12,769 INFO L215 NwaCegarLoop]: trace histogram [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, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:12,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:17:12,769 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:12,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1444198090, now seen corresponding path program 1 times [2024-10-23 21:17:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:12,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298733028] [2024-10-23 21:17:12,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 1247 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-10-23 21:17:13,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:13,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298733028] [2024-10-23 21:17:13,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298733028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:13,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:17:13,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:17:13,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767795176] [2024-10-23 21:17:13,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:13,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:13,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:13,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:13,424 INFO L87 Difference]: Start difference. First operand 4631 states and 4970 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:13,800 INFO L93 Difference]: Finished difference Result 9083 states and 9760 transitions. [2024-10-23 21:17:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:13,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 744 [2024-10-23 21:17:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:13,808 INFO L225 Difference]: With dead ends: 9083 [2024-10-23 21:17:13,809 INFO L226 Difference]: Without dead ends: 4631 [2024-10-23 21:17:13,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:13,814 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:13,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 242 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 21:17:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-23 21:17:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4097. [2024-10-23 21:17:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.078857421875) internal successors, (4419), 4096 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4419 transitions. [2024-10-23 21:17:13,871 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4419 transitions. Word has length 744 [2024-10-23 21:17:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:13,872 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4419 transitions. [2024-10-23 21:17:13,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4419 transitions. [2024-10-23 21:17:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2024-10-23 21:17:13,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:13,881 INFO L215 NwaCegarLoop]: trace histogram [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, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:13,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-23 21:17:13,881 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:13,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash -378277242, now seen corresponding path program 1 times [2024-10-23 21:17:13,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:13,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385103359] [2024-10-23 21:17:13,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 1254 proven. 155 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-10-23 21:17:14,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:14,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385103359] [2024-10-23 21:17:14,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385103359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:17:14,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494374235] [2024-10-23 21:17:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:14,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:17:14,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:17:14,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:17:14,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-23 21:17:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:14,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 21:17:14,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:17:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 1254 proven. 155 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-10-23 21:17:15,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:17:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 1254 proven. 155 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-10-23 21:17:15,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494374235] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 21:17:15,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 21:17:15,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-23 21:17:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399102892] [2024-10-23 21:17:15,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 21:17:15,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 21:17:15,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:15,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 21:17:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:17:15,430 INFO L87 Difference]: Start difference. First operand 4097 states and 4419 transitions. Second operand has 6 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:16,324 INFO L93 Difference]: Finished difference Result 9619 states and 10438 transitions. [2024-10-23 21:17:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 21:17:16,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 0 states have call successors, (0), 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 777 [2024-10-23 21:17:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:16,334 INFO L225 Difference]: With dead ends: 9619 [2024-10-23 21:17:16,335 INFO L226 Difference]: Without dead ends: 5701 [2024-10-23 21:17:16,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1556 GetRequests, 1552 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:17:16,341 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 50 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:16,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 61 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:17:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2024-10-23 21:17:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 4631. [2024-10-23 21:17:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.083585313174946) internal successors, (5017), 4630 states have internal predecessors, (5017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 5017 transitions. [2024-10-23 21:17:16,421 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 5017 transitions. Word has length 777 [2024-10-23 21:17:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:16,422 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 5017 transitions. [2024-10-23 21:17:16,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 5017 transitions. [2024-10-23 21:17:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2024-10-23 21:17:16,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:16,432 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:16,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-23 21:17:16,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-23 21:17:16,633 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:16,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash -849526563, now seen corresponding path program 1 times [2024-10-23 21:17:16,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:16,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390987339] [2024-10-23 21:17:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2176 backedges. 1614 proven. 104 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-10-23 21:17:17,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:17,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390987339] [2024-10-23 21:17:17,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390987339] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:17:17,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52578249] [2024-10-23 21:17:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:17,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:17:17,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:17:17,574 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:17:17,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-23 21:17:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:17,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:17:17,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:17:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2176 backedges. 1215 proven. 0 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2024-10-23 21:17:18,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:17:18,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52578249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:18,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:17:18,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 21:17:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902738898] [2024-10-23 21:17:18,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:18,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:18,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:18,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:17:18,015 INFO L87 Difference]: Start difference. First operand 4631 states and 5017 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:18,416 INFO L93 Difference]: Finished difference Result 9083 states and 9854 transitions. [2024-10-23 21:17:18,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:18,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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 807 [2024-10-23 21:17:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:18,425 INFO L225 Difference]: With dead ends: 9083 [2024-10-23 21:17:18,425 INFO L226 Difference]: Without dead ends: 4631 [2024-10-23 21:17:18,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 806 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:17:18,431 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:18,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 211 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:17:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-23 21:17:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4631. [2024-10-23 21:17:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0742980561555076) internal successors, (4974), 4630 states have internal predecessors, (4974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4974 transitions. [2024-10-23 21:17:18,487 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4974 transitions. Word has length 807 [2024-10-23 21:17:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:18,488 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4974 transitions. [2024-10-23 21:17:18,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4974 transitions. [2024-10-23 21:17:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2024-10-23 21:17:18,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:18,535 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:18,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-23 21:17:18,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-23 21:17:18,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:18,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1781778341, now seen corresponding path program 1 times [2024-10-23 21:17:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441465810] [2024-10-23 21:17:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:18,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2202 backedges. 1667 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-23 21:17:19,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:19,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441465810] [2024-10-23 21:17:19,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441465810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:19,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:17:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:17:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568399221] [2024-10-23 21:17:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:19,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:19,342 INFO L87 Difference]: Start difference. First operand 4631 states and 4974 transitions. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:19,727 INFO L93 Difference]: Finished difference Result 9439 states and 10139 transitions. [2024-10-23 21:17:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:19,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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 828 [2024-10-23 21:17:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:19,734 INFO L225 Difference]: With dead ends: 9439 [2024-10-23 21:17:19,734 INFO L226 Difference]: Without dead ends: 4987 [2024-10-23 21:17:19,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:19,740 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:19,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 240 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:17:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2024-10-23 21:17:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4987. [2024-10-23 21:17:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4986 states have (on average 1.064781387886081) internal successors, (5309), 4986 states have internal predecessors, (5309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 5309 transitions. [2024-10-23 21:17:19,799 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 5309 transitions. Word has length 828 [2024-10-23 21:17:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:19,800 INFO L471 AbstractCegarLoop]: Abstraction has 4987 states and 5309 transitions. [2024-10-23 21:17:19,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 5309 transitions. [2024-10-23 21:17:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-10-23 21:17:19,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:19,811 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:19,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-23 21:17:19,811 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 432176806, now seen corresponding path program 1 times [2024-10-23 21:17:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585868472] [2024-10-23 21:17:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:19,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2198 backedges. 1417 proven. 0 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-23 21:17:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585868472] [2024-10-23 21:17:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585868472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:20,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:17:20,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:17:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992269073] [2024-10-23 21:17:20,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:20,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:20,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:20,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:20,148 INFO L87 Difference]: Start difference. First operand 4987 states and 5309 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:20,537 INFO L93 Difference]: Finished difference Result 10507 states and 11226 transitions. [2024-10-23 21:17:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:20,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 849 [2024-10-23 21:17:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:20,542 INFO L225 Difference]: With dead ends: 10507 [2024-10-23 21:17:20,542 INFO L226 Difference]: Without dead ends: 5699 [2024-10-23 21:17:20,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:20,546 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 107 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:20,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 38 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:17:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2024-10-23 21:17:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5343. [2024-10-23 21:17:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5342 states have (on average 1.0608386372145264) internal successors, (5667), 5342 states have internal predecessors, (5667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 5667 transitions. [2024-10-23 21:17:20,640 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 5667 transitions. Word has length 849 [2024-10-23 21:17:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:20,640 INFO L471 AbstractCegarLoop]: Abstraction has 5343 states and 5667 transitions. [2024-10-23 21:17:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 5667 transitions. [2024-10-23 21:17:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2024-10-23 21:17:20,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:20,652 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:20,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-23 21:17:20,653 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:20,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:20,653 INFO L85 PathProgramCache]: Analyzing trace with hash -790106654, now seen corresponding path program 1 times [2024-10-23 21:17:20,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:20,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719055296] [2024-10-23 21:17:20,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:20,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2448 backedges. 1667 proven. 0 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-23 21:17:21,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:21,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719055296] [2024-10-23 21:17:21,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719055296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:17:21,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:17:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:17:21,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748704714] [2024-10-23 21:17:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:21,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:17:21,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:21,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:17:21,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:21,266 INFO L87 Difference]: Start difference. First operand 5343 states and 5667 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:21,703 INFO L93 Difference]: Finished difference Result 10685 states and 11368 transitions. [2024-10-23 21:17:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:17:21,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 906 [2024-10-23 21:17:21,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:21,711 INFO L225 Difference]: With dead ends: 10685 [2024-10-23 21:17:21,711 INFO L226 Difference]: Without dead ends: 5521 [2024-10-23 21:17:21,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:17:21,719 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:21,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 230 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:17:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2024-10-23 21:17:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 5165. [2024-10-23 21:17:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.0507358636715725) internal successors, (5426), 5164 states have internal predecessors, (5426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 5426 transitions. [2024-10-23 21:17:21,816 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 5426 transitions. Word has length 906 [2024-10-23 21:17:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:21,816 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 5426 transitions. [2024-10-23 21:17:21,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 5426 transitions. [2024-10-23 21:17:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 945 [2024-10-23 21:17:21,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:21,826 INFO L215 NwaCegarLoop]: trace histogram [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, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:21,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-23 21:17:21,827 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:21,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1115405, now seen corresponding path program 1 times [2024-10-23 21:17:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:21,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524373591] [2024-10-23 21:17:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2771 backedges. 1755 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2024-10-23 21:17:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524373591] [2024-10-23 21:17:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524373591] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:17:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838537197] [2024-10-23 21:17:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:22,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:17:22,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:17:22,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:17:22,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-23 21:17:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:23,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-23 21:17:23,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:17:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2771 backedges. 1737 proven. 643 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2024-10-23 21:17:23,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:17:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2771 backedges. 1827 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2024-10-23 21:17:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838537197] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-23 21:17:24,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-23 21:17:24,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2024-10-23 21:17:24,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348033558] [2024-10-23 21:17:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:24,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 21:17:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 21:17:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-23 21:17:24,385 INFO L87 Difference]: Start difference. First operand 5165 states and 5426 transitions. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:24,965 INFO L93 Difference]: Finished difference Result 10329 states and 10854 transitions. [2024-10-23 21:17:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:17:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 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 944 [2024-10-23 21:17:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:24,970 INFO L225 Difference]: With dead ends: 10329 [2024-10-23 21:17:24,970 INFO L226 Difference]: Without dead ends: 5343 [2024-10-23 21:17:24,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1891 GetRequests, 1883 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-23 21:17:24,974 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 117 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:24,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 8 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:17:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2024-10-23 21:17:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 5165. [2024-10-23 21:17:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.0431835786212238) internal successors, (5387), 5164 states have internal predecessors, (5387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 5387 transitions. [2024-10-23 21:17:25,032 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 5387 transitions. Word has length 944 [2024-10-23 21:17:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:25,033 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 5387 transitions. [2024-10-23 21:17:25,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 5387 transitions. [2024-10-23 21:17:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1232 [2024-10-23 21:17:25,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:25,047 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 7, 7, 7, 7, 7, 6, 5, 5, 5, 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] [2024-10-23 21:17:25,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-23 21:17:25,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:17:25,248 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:25,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1755091830, now seen corresponding path program 1 times [2024-10-23 21:17:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:25,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546680407] [2024-10-23 21:17:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 3305 proven. 272 refuted. 0 times theorem prover too weak. 1053 trivial. 0 not checked. [2024-10-23 21:17:26,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:17:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546680407] [2024-10-23 21:17:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546680407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:17:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379213573] [2024-10-23 21:17:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:26,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:17:26,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:17:26,757 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:17:26,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-23 21:17:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:17:27,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-23 21:17:27,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:17:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 3379 proven. 716 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-23 21:17:27,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:17:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 3542 proven. 0 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2024-10-23 21:17:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379213573] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-23 21:17:28,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-23 21:17:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 10 [2024-10-23 21:17:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164765190] [2024-10-23 21:17:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:17:28,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 21:17:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:17:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 21:17:28,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-23 21:17:28,310 INFO L87 Difference]: Start difference. First operand 5165 states and 5387 transitions. Second operand has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:17:28,760 INFO L93 Difference]: Finished difference Result 10151 states and 10594 transitions. [2024-10-23 21:17:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:17:28,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 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 1231 [2024-10-23 21:17:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:17:28,766 INFO L225 Difference]: With dead ends: 10151 [2024-10-23 21:17:28,766 INFO L226 Difference]: Without dead ends: 5165 [2024-10-23 21:17:28,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2466 GetRequests, 2458 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-23 21:17:28,770 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:17:28,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 8 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 21:17:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2024-10-23 21:17:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 4809. [2024-10-23 21:17:28,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0422212978369385) internal successors, (5011), 4808 states have internal predecessors, (5011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5011 transitions. [2024-10-23 21:17:28,818 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5011 transitions. Word has length 1231 [2024-10-23 21:17:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:17:28,819 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5011 transitions. [2024-10-23 21:17:28,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:17:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5011 transitions. [2024-10-23 21:17:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1482 [2024-10-23 21:17:28,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:17:28,837 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 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, 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, 7, 7, 7, 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] [2024-10-23 21:17:28,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-23 21:17:29,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-23 21:17:29,039 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:17:29,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:17:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash 951910911, now seen corresponding path program 1 times [2024-10-23 21:17:29,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:17:29,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541096317] [2024-10-23 21:17:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:17:29,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:17:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 21:17:29,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-23 21:17:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 21:17:29,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-23 21:17:29,928 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-23 21:17:29,929 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:17:29,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-23 21:17:29,934 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:17:30,264 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:17:30,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:17:30 BoogieIcfgContainer [2024-10-23 21:17:30,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:17:30,268 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:17:30,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:17:30,269 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:17:30,270 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:16:54" (3/4) ... [2024-10-23 21:17:30,271 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-23 21:17:30,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:17:30,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:17:30,693 INFO L158 Benchmark]: Toolchain (without parser) took 39014.93ms. Allocated memory was 174.1MB in the beginning and 1.0GB in the end (delta: 853.5MB). Free memory was 104.4MB in the beginning and 538.5MB in the end (delta: -434.1MB). Peak memory consumption was 418.9MB. Max. memory is 16.1GB. [2024-10-23 21:17:30,693 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:17:30,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 639.45ms. Allocated memory is still 174.1MB. Free memory was 104.3MB in the beginning and 120.2MB in the end (delta: -15.9MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-23 21:17:30,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.78ms. Allocated memory is still 174.1MB. Free memory was 120.2MB in the beginning and 110.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-23 21:17:30,697 INFO L158 Benchmark]: Boogie Preprocessor took 126.11ms. Allocated memory is still 174.1MB. Free memory was 110.5MB in the beginning and 96.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-23 21:17:30,697 INFO L158 Benchmark]: RCFGBuilder took 1496.43ms. Allocated memory is still 174.1MB. Free memory was 96.5MB in the beginning and 134.8MB in the end (delta: -38.3MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2024-10-23 21:17:30,697 INFO L158 Benchmark]: TraceAbstraction took 36205.95ms. Allocated memory was 174.1MB in the beginning and 1.0GB in the end (delta: 853.5MB). Free memory was 134.8MB in the beginning and 649.0MB in the end (delta: -514.2MB). Peak memory consumption was 338.8MB. Max. memory is 16.1GB. [2024-10-23 21:17:30,697 INFO L158 Benchmark]: Witness Printer took 423.85ms. Allocated memory is still 1.0GB. Free memory was 649.0MB in the beginning and 538.5MB in the end (delta: 110.5MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2024-10-23 21:17:30,698 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.20ms. Allocated memory is still 109.1MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 639.45ms. Allocated memory is still 174.1MB. Free memory was 104.3MB in the beginning and 120.2MB in the end (delta: -15.9MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.78ms. Allocated memory is still 174.1MB. Free memory was 120.2MB in the beginning and 110.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.11ms. Allocated memory is still 174.1MB. Free memory was 110.5MB in the beginning and 96.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1496.43ms. Allocated memory is still 174.1MB. Free memory was 96.5MB in the beginning and 134.8MB in the end (delta: -38.3MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. * TraceAbstraction took 36205.95ms. Allocated memory was 174.1MB in the beginning and 1.0GB in the end (delta: 853.5MB). Free memory was 134.8MB in the beginning and 649.0MB in the end (delta: -514.2MB). Peak memory consumption was 338.8MB. Max. memory is 16.1GB. * Witness Printer took 423.85ms. Allocated memory is still 1.0GB. Free memory was 649.0MB in the beginning and 538.5MB in the end (delta: 110.5MB). Peak memory consumption was 109.1MB. 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: 86]: 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; [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] [L890] COND TRUE 1 [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) [L890] COND TRUE 1 [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) [L890] COND TRUE 1 [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) [L890] COND TRUE 1 [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) [L890] COND TRUE 1 [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) [L890] COND TRUE 1 [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) [L890] COND TRUE 1 [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) [L890] COND TRUE 1 [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) [L890] COND TRUE 1 [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) [L890] COND TRUE 1 [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) [L890] COND TRUE 1 [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=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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, 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=-24, a15=9, a21=10, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND TRUE ((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1)) [L478] a12 = (((a12 + 66) - 3) + -2) [L479] a21 = 8 [L481] return 21; VAL [\result=21, a12=37, 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) [L890] COND TRUE 1 [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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND TRUE ( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9))) [L426] a15 = 5 [L427] a21 = 10 [L429] return -1; VAL [\result=-1, a12=37, a15=5, 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) [L890] COND TRUE 1 [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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, 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=37, a15=5, a21=10, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND TRUE ((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10)) VAL [a12=37, a15=5, a21=10, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] reach_error() VAL [a12=37, a15=5, a21=10, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.8s, OverallIterations: 24, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2554 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2554 mSDsluCounter, 2456 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 1393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11729 IncrementalHoareTripleChecker+Invalid, 13122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1393 mSolverCounterUnsat, 2337 mSDtfsCounter, 11729 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8296 GetRequests, 8234 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5343occurred in iteration=20, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 7300 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 18225 NumberOfCodeBlocks, 18225 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 19662 ConstructedInterpolants, 0 QuantifiedInterpolants, 52589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6635 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 34 InterpolantComputations, 22 PerfectInterpolantSequences, 44884/47806 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-23 21:17:30,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE