./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label29.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97dafc829fb0ac3f02551d7e03f2927da99bcc5838423c161661dae1bf6e71c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:58:20,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:58:20,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:58:20,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:58:20,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:58:21,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:58:21,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:58:21,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:58:21,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:58:21,003 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:58:21,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:58:21,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:58:21,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:58:21,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:58:21,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:58:21,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:58:21,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:58:21,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:58:21,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:58:21,005 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97dafc829fb0ac3f02551d7e03f2927da99bcc5838423c161661dae1bf6e71c3 [2025-01-08 23:58:21,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:58:21,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:58:21,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:58:21,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:58:21,244 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:58:21,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label29.c [2025-01-08 23:58:22,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e56ca71da/5ef88ba6d115424eb33431fe226d97eb/FLAGc9db276bd [2025-01-08 23:58:22,664 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:58:22,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label29.c [2025-01-08 23:58:22,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e56ca71da/5ef88ba6d115424eb33431fe226d97eb/FLAGc9db276bd [2025-01-08 23:58:22,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e56ca71da/5ef88ba6d115424eb33431fe226d97eb [2025-01-08 23:58:22,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:58:22,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:58:22,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:58:22,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:58:22,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:58:22,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:58:22" (1/1) ... [2025-01-08 23:58:22,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6bd3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:22, skipping insertion in model container [2025-01-08 23:58:22,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:58:22" (1/1) ... [2025-01-08 23:58:23,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:58:23,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label29.c[1924,1937] [2025-01-08 23:58:23,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:58:23,249 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:58:23,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label29.c[1924,1937] [2025-01-08 23:58:23,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:58:23,337 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:58:23,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23 WrapperNode [2025-01-08 23:58:23,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:58:23,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:58:23,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:58:23,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:58:23,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,404 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-01-08 23:58:23,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:58:23,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:58:23,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:58:23,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:58:23,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,456 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:58:23,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:58:23,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:58:23,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:58:23,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:58:23,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (1/1) ... [2025-01-08 23:58:23,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:58:23,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:23,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:58:23,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:58:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:58:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:58:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:58:23,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:58:23,615 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:58:23,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:58:24,558 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 23:58:24,559 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:58:24,569 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:58:24,570 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:58:24,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:58:24 BoogieIcfgContainer [2025-01-08 23:58:24,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:58:24,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:58:24,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:58:24,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:58:24,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:58:22" (1/3) ... [2025-01-08 23:58:24,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fabc765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:58:24, skipping insertion in model container [2025-01-08 23:58:24,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:58:23" (2/3) ... [2025-01-08 23:58:24,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fabc765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:58:24, skipping insertion in model container [2025-01-08 23:58:24,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:58:24" (3/3) ... [2025-01-08 23:58:24,577 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label29.c [2025-01-08 23:58:24,587 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:58:24,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label29.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:58:24,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:58:24,644 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;@2462cb69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:58:24,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:58:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 23:58:24,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:24,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:24,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:24,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:24,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1192939278, now seen corresponding path program 1 times [2025-01-08 23:58:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:24,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104195767] [2025-01-08 23:58:24,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:24,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:24,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-08 23:58:24,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 23:58:24,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:24,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:24,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:24,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104195767] [2025-01-08 23:58:24,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104195767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:24,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:24,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:58:24,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667784065] [2025-01-08 23:58:24,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:24,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:24,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:24,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:24,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:24,861 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:25,641 INFO L93 Difference]: Finished difference Result 685 states and 1213 transitions. [2025-01-08 23:58:25,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:25,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-01-08 23:58:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:25,649 INFO L225 Difference]: With dead ends: 685 [2025-01-08 23:58:25,650 INFO L226 Difference]: Without dead ends: 360 [2025-01-08 23:58:25,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:25,657 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 202 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:25,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 139 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:58:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-08 23:58:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-08 23:58:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.4206128133704736) internal successors, (510), 359 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2025-01-08 23:58:25,705 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 16 [2025-01-08 23:58:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:25,705 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2025-01-08 23:58:25,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2025-01-08 23:58:25,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-08 23:58:25,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:25,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:25,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:58:25,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:25,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1251841248, now seen corresponding path program 1 times [2025-01-08 23:58:25,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:25,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239002107] [2025-01-08 23:58:25,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:25,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:25,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-08 23:58:25,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-08 23:58:25,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:25,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:26,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:26,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239002107] [2025-01-08 23:58:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239002107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:26,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:26,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:26,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408737554] [2025-01-08 23:58:26,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:26,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:26,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:26,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:26,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:26,098 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:26,836 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2025-01-08 23:58:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:26,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-08 23:58:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:26,839 INFO L225 Difference]: With dead ends: 1074 [2025-01-08 23:58:26,839 INFO L226 Difference]: Without dead ends: 716 [2025-01-08 23:58:26,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:26,841 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 434 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:26,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 122 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:58:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-08 23:58:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-01-08 23:58:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.26993006993007) internal successors, (908), 715 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 908 transitions. [2025-01-08 23:58:26,861 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 908 transitions. Word has length 95 [2025-01-08 23:58:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:26,861 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 908 transitions. [2025-01-08 23:58:26,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 908 transitions. [2025-01-08 23:58:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-08 23:58:26,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:26,865 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:26,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:58:26,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:26,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash 470973265, now seen corresponding path program 1 times [2025-01-08 23:58:26,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:26,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142770271] [2025-01-08 23:58:26,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:26,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-08 23:58:26,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-08 23:58:26,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:26,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 23:58:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142770271] [2025-01-08 23:58:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142770271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:27,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:58:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327439354] [2025-01-08 23:58:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:27,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:27,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:27,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:27,033 INFO L87 Difference]: Start difference. First operand 716 states and 908 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:27,565 INFO L93 Difference]: Finished difference Result 1430 states and 1917 transitions. [2025-01-08 23:58:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:27,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-01-08 23:58:27,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:27,569 INFO L225 Difference]: With dead ends: 1430 [2025-01-08 23:58:27,569 INFO L226 Difference]: Without dead ends: 894 [2025-01-08 23:58:27,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:27,570 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:27,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:58:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-01-08 23:58:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2025-01-08 23:58:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.257558790593505) internal successors, (1123), 893 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1123 transitions. [2025-01-08 23:58:27,596 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1123 transitions. Word has length 161 [2025-01-08 23:58:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:27,596 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1123 transitions. [2025-01-08 23:58:27,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1123 transitions. [2025-01-08 23:58:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-08 23:58:27,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:27,602 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:27,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:58:27,602 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:27,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2118755628, now seen corresponding path program 1 times [2025-01-08 23:58:27,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:27,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402096006] [2025-01-08 23:58:27,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:27,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:27,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-08 23:58:27,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-08 23:58:27,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:27,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:58:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402096006] [2025-01-08 23:58:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402096006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:27,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:27,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086433631] [2025-01-08 23:58:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:27,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:27,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:27,854 INFO L87 Difference]: Start difference. First operand 894 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:28,447 INFO L93 Difference]: Finished difference Result 1815 states and 2291 transitions. [2025-01-08 23:58:28,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:28,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-01-08 23:58:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:28,453 INFO L225 Difference]: With dead ends: 1815 [2025-01-08 23:58:28,453 INFO L226 Difference]: Without dead ends: 1072 [2025-01-08 23:58:28,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:28,455 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 110 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:28,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 113 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:58:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-01-08 23:58:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2025-01-08 23:58:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.1590145576707727) internal successors, (1035), 893 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1035 transitions. [2025-01-08 23:58:28,472 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1035 transitions. Word has length 175 [2025-01-08 23:58:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:28,473 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1035 transitions. [2025-01-08 23:58:28,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1035 transitions. [2025-01-08 23:58:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-08 23:58:28,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:28,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:28,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:58:28,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:28,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:28,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1214530132, now seen corresponding path program 1 times [2025-01-08 23:58:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:28,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976446900] [2025-01-08 23:58:28,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:28,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-08 23:58:28,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-08 23:58:28,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:28,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 23:58:28,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:28,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976446900] [2025-01-08 23:58:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976446900] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:28,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627359265] [2025-01-08 23:58:28,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:28,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:28,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:28,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:28,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:58:28,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-08 23:58:28,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-08 23:58:28,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:28,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:28,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:28,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:58:28,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627359265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 23:58:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956054645] [2025-01-08 23:58:28,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:28,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:28,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:28,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:28,872 INFO L87 Difference]: Start difference. First operand 894 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:29,322 INFO L93 Difference]: Finished difference Result 1608 states and 1889 transitions. [2025-01-08 23:58:29,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 227 [2025-01-08 23:58:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:29,332 INFO L225 Difference]: With dead ends: 1608 [2025-01-08 23:58:29,332 INFO L226 Difference]: Without dead ends: 1606 [2025-01-08 23:58:29,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:58:29,333 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 169 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:29,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 11 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-01-08 23:58:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1250. [2025-01-08 23:58:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.2033626901521217) internal successors, (1503), 1249 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1503 transitions. [2025-01-08 23:58:29,353 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1503 transitions. Word has length 227 [2025-01-08 23:58:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:29,354 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1503 transitions. [2025-01-08 23:58:29,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1503 transitions. [2025-01-08 23:58:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-08 23:58:29,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:29,356 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:58:29,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:58:29,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:29,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1976479095, now seen corresponding path program 1 times [2025-01-08 23:58:29,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:29,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622358110] [2025-01-08 23:58:29,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:29,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-08 23:58:29,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-08 23:58:29,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:29,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:58:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:29,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622358110] [2025-01-08 23:58:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622358110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:29,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:29,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:29,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131793339] [2025-01-08 23:58:29,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:29,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:29,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:29,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:29,823 INFO L87 Difference]: Start difference. First operand 1250 states and 1503 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:30,282 INFO L93 Difference]: Finished difference Result 2676 states and 3293 transitions. [2025-01-08 23:58:30,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:30,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 296 [2025-01-08 23:58:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:30,287 INFO L225 Difference]: With dead ends: 2676 [2025-01-08 23:58:30,288 INFO L226 Difference]: Without dead ends: 1606 [2025-01-08 23:58:30,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:30,290 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:30,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-01-08 23:58:30,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-01-08 23:58:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1825545171339564) internal successors, (1898), 1605 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1898 transitions. [2025-01-08 23:58:30,315 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1898 transitions. Word has length 296 [2025-01-08 23:58:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:30,316 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1898 transitions. [2025-01-08 23:58:30,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1898 transitions. [2025-01-08 23:58:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-08 23:58:30,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:30,318 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 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] [2025-01-08 23:58:30,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:58:30,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:30,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1498239712, now seen corresponding path program 1 times [2025-01-08 23:58:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854583426] [2025-01-08 23:58:30,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:30,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-08 23:58:30,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-08 23:58:30,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:30,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-01-08 23:58:30,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:30,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854583426] [2025-01-08 23:58:30,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854583426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:30,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:30,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:30,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353651123] [2025-01-08 23:58:30,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:30,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:30,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:30,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:30,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:30,485 INFO L87 Difference]: Start difference. First operand 1606 states and 1898 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:30,934 INFO L93 Difference]: Finished difference Result 3566 states and 4299 transitions. [2025-01-08 23:58:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:30,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 307 [2025-01-08 23:58:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:30,941 INFO L225 Difference]: With dead ends: 3566 [2025-01-08 23:58:30,941 INFO L226 Difference]: Without dead ends: 2140 [2025-01-08 23:58:30,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:30,943 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 167 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:30,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 83 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-01-08 23:58:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1784. [2025-01-08 23:58:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1817162086371285) internal successors, (2107), 1783 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2107 transitions. [2025-01-08 23:58:30,973 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2107 transitions. Word has length 307 [2025-01-08 23:58:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:30,974 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2107 transitions. [2025-01-08 23:58:30,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2107 transitions. [2025-01-08 23:58:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-08 23:58:30,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:30,977 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:58:30,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:58:30,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:30,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1762759091, now seen corresponding path program 1 times [2025-01-08 23:58:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:30,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122926337] [2025-01-08 23:58:30,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:30,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-08 23:58:31,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-08 23:58:31,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:31,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 246 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 23:58:31,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:31,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122926337] [2025-01-08 23:58:31,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122926337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:31,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950356661] [2025-01-08 23:58:31,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:31,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:31,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:31,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:31,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:58:31,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-08 23:58:31,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-08 23:58:31,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:31,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:31,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:31,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-08 23:58:31,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:31,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950356661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:31,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:31,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:31,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214253639] [2025-01-08 23:58:31,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:31,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:31,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:31,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:31,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:31,439 INFO L87 Difference]: Start difference. First operand 1784 states and 2107 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:31,839 INFO L93 Difference]: Finished difference Result 4278 states and 5035 transitions. [2025-01-08 23:58:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:31,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 320 [2025-01-08 23:58:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:31,846 INFO L225 Difference]: With dead ends: 4278 [2025-01-08 23:58:31,847 INFO L226 Difference]: Without dead ends: 2318 [2025-01-08 23:58:31,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:31,849 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 165 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:31,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 265 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-01-08 23:58:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1962. [2025-01-08 23:58:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.1636919938806731) internal successors, (2282), 1961 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2282 transitions. [2025-01-08 23:58:31,880 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2282 transitions. Word has length 320 [2025-01-08 23:58:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:31,880 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2282 transitions. [2025-01-08 23:58:31,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2282 transitions. [2025-01-08 23:58:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-08 23:58:31,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:31,883 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 23:58:31,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:58:32,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:32,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:32,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1577264732, now seen corresponding path program 1 times [2025-01-08 23:58:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034768670] [2025-01-08 23:58:32,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:32,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-08 23:58:32,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-08 23:58:32,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:32,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 290 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 23:58:32,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:32,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034768670] [2025-01-08 23:58:32,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034768670] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:32,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707188872] [2025-01-08 23:58:32,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:32,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:32,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:32,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:32,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:58:32,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-08 23:58:32,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-08 23:58:32,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:32,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:32,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:32,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-01-08 23:58:32,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:32,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707188872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:32,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:32,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417825118] [2025-01-08 23:58:32,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:32,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:32,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:32,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:32,572 INFO L87 Difference]: Start difference. First operand 1962 states and 2282 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:32,984 INFO L93 Difference]: Finished difference Result 2498 states and 2913 transitions. [2025-01-08 23:58:32,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:32,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 342 [2025-01-08 23:58:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:32,991 INFO L225 Difference]: With dead ends: 2498 [2025-01-08 23:58:32,991 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:58:32,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:32,993 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 186 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:32,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 11 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:58:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1784. [2025-01-08 23:58:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1385305664610208) internal successors, (2030), 1783 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2030 transitions. [2025-01-08 23:58:33,025 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2030 transitions. Word has length 342 [2025-01-08 23:58:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:33,026 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2030 transitions. [2025-01-08 23:58:33,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2030 transitions. [2025-01-08 23:58:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-08 23:58:33,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:33,030 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:33,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:58:33,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:33,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:33,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1694205693, now seen corresponding path program 1 times [2025-01-08 23:58:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:33,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943234245] [2025-01-08 23:58:33,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:33,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:33,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-08 23:58:33,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-08 23:58:33,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:33,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 461 proven. 23 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-08 23:58:33,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:33,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943234245] [2025-01-08 23:58:33,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943234245] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:33,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749359565] [2025-01-08 23:58:33,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:33,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:33,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:33,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:33,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 23:58:33,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-08 23:58:33,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-08 23:58:33,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:33,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:33,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:58:33,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-08 23:58:34,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:34,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749359565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:34,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:34,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:34,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652858522] [2025-01-08 23:58:34,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:34,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:34,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:34,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:34,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:34,114 INFO L87 Difference]: Start difference. First operand 1784 states and 2030 transitions. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:34,709 INFO L93 Difference]: Finished difference Result 3566 states and 4062 transitions. [2025-01-08 23:58:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:34,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 429 [2025-01-08 23:58:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:34,715 INFO L225 Difference]: With dead ends: 3566 [2025-01-08 23:58:34,715 INFO L226 Difference]: Without dead ends: 1962 [2025-01-08 23:58:34,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:34,717 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:34,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 50 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:58:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-08 23:58:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2025-01-08 23:58:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1346045989904656) internal successors, (2023), 1783 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2023 transitions. [2025-01-08 23:58:34,747 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2023 transitions. Word has length 429 [2025-01-08 23:58:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:34,747 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2023 transitions. [2025-01-08 23:58:34,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2023 transitions. [2025-01-08 23:58:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-08 23:58:34,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:34,755 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:34,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 23:58:34,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 23:58:34,956 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:34,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash 505326475, now seen corresponding path program 1 times [2025-01-08 23:58:34,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:34,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494522398] [2025-01-08 23:58:34,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:34,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:34,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-08 23:58:35,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-08 23:58:35,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:35,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-01-08 23:58:35,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:35,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494522398] [2025-01-08 23:58:35,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494522398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:35,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:35,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168971466] [2025-01-08 23:58:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:35,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:35,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:35,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:35,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:35,206 INFO L87 Difference]: Start difference. First operand 1784 states and 2023 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:35,670 INFO L93 Difference]: Finished difference Result 3595 states and 4077 transitions. [2025-01-08 23:58:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:35,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 485 [2025-01-08 23:58:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:35,675 INFO L225 Difference]: With dead ends: 3595 [2025-01-08 23:58:35,675 INFO L226 Difference]: Without dead ends: 1962 [2025-01-08 23:58:35,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:58:35,677 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 140 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:35,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 17 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-08 23:58:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2025-01-08 23:58:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.085249579360628) internal successors, (1935), 1783 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1935 transitions. [2025-01-08 23:58:35,702 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1935 transitions. Word has length 485 [2025-01-08 23:58:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:35,703 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 1935 transitions. [2025-01-08 23:58:35,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1935 transitions. [2025-01-08 23:58:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-01-08 23:58:35,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:35,708 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:35,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:58:35,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:35,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2008911882, now seen corresponding path program 1 times [2025-01-08 23:58:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:35,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931313141] [2025-01-08 23:58:35,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:35,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:35,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-01-08 23:58:35,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-01-08 23:58:35,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:35,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 639 proven. 11 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-08 23:58:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931313141] [2025-01-08 23:58:36,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931313141] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605387012] [2025-01-08 23:58:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:36,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:36,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:36,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:36,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 23:58:36,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-01-08 23:58:36,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-01-08 23:58:36,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:36,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:36,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:58:36,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2025-01-08 23:58:36,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:36,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605387012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:36,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:58:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898013708] [2025-01-08 23:58:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:36,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:36,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:36,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:36,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:36,546 INFO L87 Difference]: Start difference. First operand 1784 states and 1935 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:36,875 INFO L93 Difference]: Finished difference Result 4100 states and 4437 transitions. [2025-01-08 23:58:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:36,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 511 [2025-01-08 23:58:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:36,880 INFO L225 Difference]: With dead ends: 4100 [2025-01-08 23:58:36,880 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:58:36,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:36,883 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:36,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 48 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:36,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:58:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1962. [2025-01-08 23:58:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.0866904640489545) internal successors, (2131), 1961 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2131 transitions. [2025-01-08 23:58:36,907 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2131 transitions. Word has length 511 [2025-01-08 23:58:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:36,907 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2131 transitions. [2025-01-08 23:58:36,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2131 transitions. [2025-01-08 23:58:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-01-08 23:58:36,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:36,911 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:36,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 23:58:37,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 23:58:37,112 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:37,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1303609374, now seen corresponding path program 1 times [2025-01-08 23:58:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:37,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626488559] [2025-01-08 23:58:37,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:37,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:37,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-01-08 23:58:37,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-01-08 23:58:37,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:37,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 564 proven. 93 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-08 23:58:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626488559] [2025-01-08 23:58:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626488559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496153602] [2025-01-08 23:58:37,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:37,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:37,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:37,490 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:37,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 23:58:37,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-01-08 23:58:37,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-01-08 23:58:37,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:37,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:37,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:37,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-08 23:58:37,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:37,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496153602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:37,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:37,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:37,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761261121] [2025-01-08 23:58:37,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:37,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:37,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:37,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:37,845 INFO L87 Difference]: Start difference. First operand 1962 states and 2131 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:38,173 INFO L93 Difference]: Finished difference Result 4634 states and 5076 transitions. [2025-01-08 23:58:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:38,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 585 [2025-01-08 23:58:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:38,179 INFO L225 Difference]: With dead ends: 4634 [2025-01-08 23:58:38,180 INFO L226 Difference]: Without dead ends: 2852 [2025-01-08 23:58:38,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:38,182 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:38,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 51 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-01-08 23:58:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2025-01-08 23:58:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.0823045267489713) internal successors, (2893), 2673 states have internal predecessors, (2893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2893 transitions. [2025-01-08 23:58:38,209 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2893 transitions. Word has length 585 [2025-01-08 23:58:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:38,210 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2893 transitions. [2025-01-08 23:58:38,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2893 transitions. [2025-01-08 23:58:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-08 23:58:38,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:38,213 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:38,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 23:58:38,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-08 23:58:38,414 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:38,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1143458291, now seen corresponding path program 1 times [2025-01-08 23:58:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:38,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958565196] [2025-01-08 23:58:38,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:38,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-08 23:58:38,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-08 23:58:38,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:38,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 926 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-01-08 23:58:38,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958565196] [2025-01-08 23:58:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958565196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:38,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:38,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52979721] [2025-01-08 23:58:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:38,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:38,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:38,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:38,677 INFO L87 Difference]: Start difference. First operand 2674 states and 2893 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:38,981 INFO L93 Difference]: Finished difference Result 5880 states and 6362 transitions. [2025-01-08 23:58:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:38,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 587 [2025-01-08 23:58:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:38,988 INFO L225 Difference]: With dead ends: 5880 [2025-01-08 23:58:38,988 INFO L226 Difference]: Without dead ends: 3208 [2025-01-08 23:58:38,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:38,990 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:38,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 240 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-01-08 23:58:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2025-01-08 23:58:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.0726061031217118) internal successors, (3058), 2851 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3058 transitions. [2025-01-08 23:58:39,024 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3058 transitions. Word has length 587 [2025-01-08 23:58:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:39,024 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3058 transitions. [2025-01-08 23:58:39,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3058 transitions. [2025-01-08 23:58:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2025-01-08 23:58:39,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:39,028 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:58:39,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:58:39,029 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:39,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash 263733052, now seen corresponding path program 1 times [2025-01-08 23:58:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:39,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333344265] [2025-01-08 23:58:39,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:39,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:39,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 740 statements into 1 equivalence classes. [2025-01-08 23:58:39,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 740 of 740 statements. [2025-01-08 23:58:39,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:39,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 1064 proven. 155 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-08 23:58:39,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:39,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333344265] [2025-01-08 23:58:39,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333344265] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:39,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273069932] [2025-01-08 23:58:39,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:39,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:39,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:39,333 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:39,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 23:58:39,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 740 statements into 1 equivalence classes. [2025-01-08 23:58:39,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 740 of 740 statements. [2025-01-08 23:58:39,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:39,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:39,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:58:39,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 1064 proven. 155 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-08 23:58:39,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:58:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 1064 proven. 155 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-08 23:58:39,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273069932] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:58:39,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:58:39,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-08 23:58:39,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248290730] [2025-01-08 23:58:39,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:58:39,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 23:58:39,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:39,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 23:58:39,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:39,989 INFO L87 Difference]: Start difference. First operand 2852 states and 3058 transitions. Second operand has 6 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:40,672 INFO L93 Difference]: Finished difference Result 7128 states and 7699 transitions. [2025-01-08 23:58:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:58:40,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 0 states have call successors, (0), 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 740 [2025-01-08 23:58:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:40,681 INFO L225 Difference]: With dead ends: 7128 [2025-01-08 23:58:40,681 INFO L226 Difference]: Without dead ends: 4456 [2025-01-08 23:58:40,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1482 GetRequests, 1478 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:40,684 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 75 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:40,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 53 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:58:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2025-01-08 23:58:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 3564. [2025-01-08 23:58:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.082795397137244) internal successors, (3858), 3563 states have internal predecessors, (3858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3858 transitions. [2025-01-08 23:58:40,714 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3858 transitions. Word has length 740 [2025-01-08 23:58:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:40,715 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3858 transitions. [2025-01-08 23:58:40,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3858 transitions. [2025-01-08 23:58:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2025-01-08 23:58:40,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:40,720 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2025-01-08 23:58:40,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 23:58:40,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:40,920 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:40,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash 262776235, now seen corresponding path program 1 times [2025-01-08 23:58:40,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:40,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621049678] [2025-01-08 23:58:40,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:40,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:40,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 742 statements into 1 equivalence classes. [2025-01-08 23:58:40,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 742 of 742 statements. [2025-01-08 23:58:40,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:40,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 1187 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2025-01-08 23:58:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621049678] [2025-01-08 23:58:41,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621049678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:41,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:41,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786290759] [2025-01-08 23:58:41,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:41,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:41,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:41,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:41,326 INFO L87 Difference]: Start difference. First operand 3564 states and 3858 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:41,648 INFO L93 Difference]: Finished difference Result 8016 states and 8734 transitions. [2025-01-08 23:58:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:41,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 742 [2025-01-08 23:58:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:41,656 INFO L225 Difference]: With dead ends: 8016 [2025-01-08 23:58:41,656 INFO L226 Difference]: Without dead ends: 4454 [2025-01-08 23:58:41,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:41,659 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:41,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 238 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-08 23:58:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4098. [2025-01-08 23:58:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.0676104466682939) internal successors, (4374), 4097 states have internal predecessors, (4374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4374 transitions. [2025-01-08 23:58:41,689 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4374 transitions. Word has length 742 [2025-01-08 23:58:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:41,690 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4374 transitions. [2025-01-08 23:58:41,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4374 transitions. [2025-01-08 23:58:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-01-08 23:58:41,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:41,695 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2025-01-08 23:58:41,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:58:41,695 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:41,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash -817301864, now seen corresponding path program 1 times [2025-01-08 23:58:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:41,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130541773] [2025-01-08 23:58:41,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:41,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:41,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-01-08 23:58:41,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-01-08 23:58:41,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:41,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 1358 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2025-01-08 23:58:42,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130541773] [2025-01-08 23:58:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130541773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:42,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:42,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888301935] [2025-01-08 23:58:42,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:42,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:42,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:42,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:42,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:42,020 INFO L87 Difference]: Start difference. First operand 4098 states and 4374 transitions. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:42,366 INFO L93 Difference]: Finished difference Result 8550 states and 9111 transitions. [2025-01-08 23:58:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 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 760 [2025-01-08 23:58:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:42,374 INFO L225 Difference]: With dead ends: 8550 [2025-01-08 23:58:42,374 INFO L226 Difference]: Without dead ends: 4632 [2025-01-08 23:58:42,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:42,378 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:42,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-08 23:58:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4276. [2025-01-08 23:58:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.065263157894737) internal successors, (4554), 4275 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4554 transitions. [2025-01-08 23:58:42,410 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4554 transitions. Word has length 760 [2025-01-08 23:58:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:42,410 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4554 transitions. [2025-01-08 23:58:42,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4554 transitions. [2025-01-08 23:58:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2025-01-08 23:58:42,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:42,415 INFO L218 NwaCegarLoop]: trace histogram [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, 8, 8, 8, 8, 8, 7, 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, 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] [2025-01-08 23:58:42,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:58:42,416 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:42,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1964010205, now seen corresponding path program 1 times [2025-01-08 23:58:42,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:42,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861455166] [2025-01-08 23:58:42,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:42,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 837 statements into 1 equivalence classes. [2025-01-08 23:58:42,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 837 of 837 statements. [2025-01-08 23:58:42,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:42,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 1417 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2025-01-08 23:58:42,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:42,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861455166] [2025-01-08 23:58:42,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861455166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:42,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:42,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593057564] [2025-01-08 23:58:42,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:42,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:42,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:42,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:42,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:42,854 INFO L87 Difference]: Start difference. First operand 4276 states and 4554 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:43,153 INFO L93 Difference]: Finished difference Result 9084 states and 9721 transitions. [2025-01-08 23:58:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 837 [2025-01-08 23:58:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:43,160 INFO L225 Difference]: With dead ends: 9084 [2025-01-08 23:58:43,161 INFO L226 Difference]: Without dead ends: 4810 [2025-01-08 23:58:43,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:43,165 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:43,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 223 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-01-08 23:58:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4454. [2025-01-08 23:58:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.064226364248821) internal successors, (4739), 4453 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4739 transitions. [2025-01-08 23:58:43,199 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4739 transitions. Word has length 837 [2025-01-08 23:58:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:43,200 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4739 transitions. [2025-01-08 23:58:43,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4739 transitions. [2025-01-08 23:58:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 912 [2025-01-08 23:58:43,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:43,205 INFO L218 NwaCegarLoop]: trace histogram [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, 8, 8, 8, 8, 8, 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, 5, 4, 4, 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] [2025-01-08 23:58:43,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:58:43,206 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:43,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -548409552, now seen corresponding path program 1 times [2025-01-08 23:58:43,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:43,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992681842] [2025-01-08 23:58:43,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:43,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 911 statements into 1 equivalence classes. [2025-01-08 23:58:43,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 911 of 911 statements. [2025-01-08 23:58:43,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:43,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 1293 proven. 155 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2025-01-08 23:58:43,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:43,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992681842] [2025-01-08 23:58:43,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992681842] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:43,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488732511] [2025-01-08 23:58:43,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:43,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:43,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:43,730 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:43,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 23:58:43,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 911 statements into 1 equivalence classes. [2025-01-08 23:58:43,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 911 of 911 statements. [2025-01-08 23:58:43,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:43,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:43,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:58:43,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 1448 proven. 0 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2025-01-08 23:58:44,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488732511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:44,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:44,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715866088] [2025-01-08 23:58:44,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:44,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:44,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:44,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:44,545 INFO L87 Difference]: Start difference. First operand 4454 states and 4739 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:44,986 INFO L93 Difference]: Finished difference Result 9262 states and 9877 transitions. [2025-01-08 23:58:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 911 [2025-01-08 23:58:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:44,993 INFO L225 Difference]: With dead ends: 9262 [2025-01-08 23:58:44,994 INFO L226 Difference]: Without dead ends: 4810 [2025-01-08 23:58:44,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 909 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:44,998 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:44,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 45 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-01-08 23:58:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4454. [2025-01-08 23:58:45,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0559173590837638) internal successors, (4702), 4453 states have internal predecessors, (4702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4702 transitions. [2025-01-08 23:58:45,034 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4702 transitions. Word has length 911 [2025-01-08 23:58:45,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:45,035 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4702 transitions. [2025-01-08 23:58:45,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4702 transitions. [2025-01-08 23:58:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2025-01-08 23:58:45,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:45,041 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:45,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 23:58:45,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:45,242 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:45,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:45,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1207002363, now seen corresponding path program 1 times [2025-01-08 23:58:45,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:45,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965421567] [2025-01-08 23:58:45,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:45,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:45,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 950 statements into 1 equivalence classes. [2025-01-08 23:58:45,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 950 of 950 statements. [2025-01-08 23:58:45,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:45,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1333 proven. 0 refuted. 0 times theorem prover too weak. 1916 trivial. 0 not checked. [2025-01-08 23:58:45,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965421567] [2025-01-08 23:58:45,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965421567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:45,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:45,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:58:45,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867775556] [2025-01-08 23:58:45,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:45,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:58:45,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:45,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:58:45,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:45,808 INFO L87 Difference]: Start difference. First operand 4454 states and 4702 transitions. Second operand has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:46,156 INFO L93 Difference]: Finished difference Result 8956 states and 9456 transitions. [2025-01-08 23:58:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:58:46,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 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 950 [2025-01-08 23:58:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:46,163 INFO L225 Difference]: With dead ends: 8956 [2025-01-08 23:58:46,163 INFO L226 Difference]: Without dead ends: 4632 [2025-01-08 23:58:46,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:46,167 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:46,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 23 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-01-08 23:58:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2025-01-08 23:58:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0469346507972153) internal successors, (4662), 4453 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4662 transitions. [2025-01-08 23:58:46,199 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4662 transitions. Word has length 950 [2025-01-08 23:58:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:46,199 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4662 transitions. [2025-01-08 23:58:46,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4662 transitions. [2025-01-08 23:58:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2025-01-08 23:58:46,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:46,205 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 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, 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, 1, 1] [2025-01-08 23:58:46,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 23:58:46,206 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:46,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2002269752, now seen corresponding path program 1 times [2025-01-08 23:58:46,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:46,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147085397] [2025-01-08 23:58:46,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:46,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:46,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 982 statements into 1 equivalence classes. [2025-01-08 23:58:46,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 982 of 982 statements. [2025-01-08 23:58:46,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:46,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3153 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2025-01-08 23:58:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:46,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147085397] [2025-01-08 23:58:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147085397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:58:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:58:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989356225] [2025-01-08 23:58:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:46,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:46,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:46,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:46,731 INFO L87 Difference]: Start difference. First operand 4454 states and 4662 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:46,991 INFO L93 Difference]: Finished difference Result 8728 states and 9143 transitions. [2025-01-08 23:58:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:46,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 982 [2025-01-08 23:58:46,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:46,997 INFO L225 Difference]: With dead ends: 8728 [2025-01-08 23:58:46,997 INFO L226 Difference]: Without dead ends: 4454 [2025-01-08 23:58:47,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:58:47,001 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 111 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:47,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 228 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 23:58:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-01-08 23:58:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2025-01-08 23:58:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.042667864361105) internal successors, (4643), 4453 states have internal predecessors, (4643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4643 transitions. [2025-01-08 23:58:47,036 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4643 transitions. Word has length 982 [2025-01-08 23:58:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:47,037 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4643 transitions. [2025-01-08 23:58:47,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4643 transitions. [2025-01-08 23:58:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2025-01-08 23:58:47,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:47,043 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:47,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:58:47,044 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:47,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1479173312, now seen corresponding path program 1 times [2025-01-08 23:58:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:47,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614220417] [2025-01-08 23:58:47,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:47,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:47,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1030 statements into 1 equivalence classes. [2025-01-08 23:58:47,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1030 of 1030 statements. [2025-01-08 23:58:47,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:47,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3350 backedges. 2320 proven. 72 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2025-01-08 23:58:47,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:47,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614220417] [2025-01-08 23:58:47,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614220417] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:47,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002751831] [2025-01-08 23:58:47,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:47,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:47,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:47,970 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:47,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 23:58:48,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1030 statements into 1 equivalence classes. [2025-01-08 23:58:48,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1030 of 1030 statements. [2025-01-08 23:58:48,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:48,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:48,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:58:48,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3350 backedges. 2279 proven. 666 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-01-08 23:58:48,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:58:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3350 backedges. 2392 proven. 0 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2025-01-08 23:58:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002751831] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:49,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:58:49,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-01-08 23:58:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927666031] [2025-01-08 23:58:49,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:49,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:58:49,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:49,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:58:49,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:58:49,158 INFO L87 Difference]: Start difference. First operand 4454 states and 4643 transitions. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:49,547 INFO L93 Difference]: Finished difference Result 9440 states and 9857 transitions. [2025-01-08 23:58:49,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:49,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 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 1030 [2025-01-08 23:58:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:49,553 INFO L225 Difference]: With dead ends: 9440 [2025-01-08 23:58:49,553 INFO L226 Difference]: Without dead ends: 5166 [2025-01-08 23:58:49,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2063 GetRequests, 2055 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:58:49,558 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 112 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:49,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 10 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-01-08 23:58:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4632. [2025-01-08 23:58:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0431872165838911) internal successors, (4831), 4631 states have internal predecessors, (4831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4831 transitions. [2025-01-08 23:58:49,596 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4831 transitions. Word has length 1030 [2025-01-08 23:58:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:49,596 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4831 transitions. [2025-01-08 23:58:49,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4831 transitions. [2025-01-08 23:58:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2025-01-08 23:58:49,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:49,604 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:49,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-08 23:58:49,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:49,805 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:49,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2010527713, now seen corresponding path program 1 times [2025-01-08 23:58:49,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:49,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146006236] [2025-01-08 23:58:49,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:49,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:49,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1189 statements into 1 equivalence classes. [2025-01-08 23:58:49,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1189 of 1189 statements. [2025-01-08 23:58:49,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:49,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3886 backedges. 2856 proven. 72 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2025-01-08 23:58:50,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:50,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146006236] [2025-01-08 23:58:50,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146006236] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:50,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933498895] [2025-01-08 23:58:50,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:50,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:50,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:50,806 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:50,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 23:58:50,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1189 statements into 1 equivalence classes. [2025-01-08 23:58:51,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1189 of 1189 statements. [2025-01-08 23:58:51,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:51,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:51,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 23:58:51,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3886 backedges. 2569 proven. 0 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2025-01-08 23:58:51,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:51,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933498895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:51,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:51,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-08 23:58:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273239390] [2025-01-08 23:58:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:51,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:58:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:51,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:58:51,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:51,383 INFO L87 Difference]: Start difference. First operand 4632 states and 4831 transitions. Second operand has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:51,835 INFO L93 Difference]: Finished difference Result 9974 states and 10388 transitions. [2025-01-08 23:58:51,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:58:51,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 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 1189 [2025-01-08 23:58:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:51,841 INFO L225 Difference]: With dead ends: 9974 [2025-01-08 23:58:51,841 INFO L226 Difference]: Without dead ends: 5522 [2025-01-08 23:58:51,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1193 GetRequests, 1188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:58:51,844 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:51,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 36 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:58:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2025-01-08 23:58:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4988. [2025-01-08 23:58:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0413073992380188) internal successors, (5193), 4987 states have internal predecessors, (5193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5193 transitions. [2025-01-08 23:58:51,880 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5193 transitions. Word has length 1189 [2025-01-08 23:58:51,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:51,881 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5193 transitions. [2025-01-08 23:58:51,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5193 transitions. [2025-01-08 23:58:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1350 [2025-01-08 23:58:51,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:51,891 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:51,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-08 23:58:52,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-08 23:58:52,091 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:52,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1204951573, now seen corresponding path program 1 times [2025-01-08 23:58:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:52,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441008972] [2025-01-08 23:58:52,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:52,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1349 statements into 1 equivalence classes. [2025-01-08 23:58:52,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1349 of 1349 statements. [2025-01-08 23:58:52,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:52,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4814 backedges. 2766 proven. 95 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2025-01-08 23:58:53,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:53,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441008972] [2025-01-08 23:58:53,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441008972] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:53,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760362422] [2025-01-08 23:58:53,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:53,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:53,050 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:53,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 23:58:53,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1349 statements into 1 equivalence classes. [2025-01-08 23:58:53,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1349 of 1349 statements. [2025-01-08 23:58:53,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:53,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:53,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 1596 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:53,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4814 backedges. 2861 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2025-01-08 23:58:53,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:53,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760362422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:53,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:53,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445720511] [2025-01-08 23:58:53,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:53,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:53,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:53,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:53,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:53,447 INFO L87 Difference]: Start difference. First operand 4988 states and 5193 transitions. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:53,732 INFO L93 Difference]: Finished difference Result 10330 states and 10788 transitions. [2025-01-08 23:58:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1349 [2025-01-08 23:58:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:53,738 INFO L225 Difference]: With dead ends: 10330 [2025-01-08 23:58:53,738 INFO L226 Difference]: Without dead ends: 5522 [2025-01-08 23:58:53,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1352 GetRequests, 1348 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:53,741 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:53,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 224 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2025-01-08 23:58:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5166. [2025-01-08 23:58:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.039109390125847) internal successors, (5367), 5165 states have internal predecessors, (5367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5367 transitions. [2025-01-08 23:58:53,776 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5367 transitions. Word has length 1349 [2025-01-08 23:58:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:53,777 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5367 transitions. [2025-01-08 23:58:53,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5367 transitions. [2025-01-08 23:58:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1440 [2025-01-08 23:58:53,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:53,787 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:53,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-08 23:58:53,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-08 23:58:53,988 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:53,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash -143018024, now seen corresponding path program 1 times [2025-01-08 23:58:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:53,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241032810] [2025-01-08 23:58:53,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:53,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:54,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1439 statements into 1 equivalence classes. [2025-01-08 23:58:54,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1439 of 1439 statements. [2025-01-08 23:58:54,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:54,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5972 backedges. 2438 proven. 28 refuted. 0 times theorem prover too weak. 3506 trivial. 0 not checked. [2025-01-08 23:58:55,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:55,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241032810] [2025-01-08 23:58:55,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241032810] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:55,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681101621] [2025-01-08 23:58:55,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:55,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:55,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:55,340 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:58:55,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 23:58:55,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1439 statements into 1 equivalence classes. [2025-01-08 23:58:55,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1439 of 1439 statements. [2025-01-08 23:58:55,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:55,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:55,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 23:58:55,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5972 backedges. 1382 proven. 14 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2025-01-08 23:58:56,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:58:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5972 backedges. 1382 proven. 14 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2025-01-08 23:58:56,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681101621] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:58:56,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:58:56,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2025-01-08 23:58:56,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183359900] [2025-01-08 23:58:56,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:58:56,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 23:58:56,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:56,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 23:58:56,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:58:56,649 INFO L87 Difference]: Start difference. First operand 5166 states and 5367 transitions. Second operand has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:58,185 INFO L93 Difference]: Finished difference Result 14602 states and 15192 transitions. [2025-01-08 23:58:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 23:58:58,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 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 1439 [2025-01-08 23:58:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:58,196 INFO L225 Difference]: With dead ends: 14602 [2025-01-08 23:58:58,196 INFO L226 Difference]: Without dead ends: 9082 [2025-01-08 23:58:58,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2885 GetRequests, 2876 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:58:58,204 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 908 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:58,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 50 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2641 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-08 23:58:58,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9082 states. [2025-01-08 23:58:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9082 to 4276. [2025-01-08 23:58:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0257309941520467) internal successors, (4385), 4275 states have internal predecessors, (4385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4385 transitions. [2025-01-08 23:58:58,258 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4385 transitions. Word has length 1439 [2025-01-08 23:58:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:58,259 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4385 transitions. [2025-01-08 23:58:58,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:58:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4385 transitions. [2025-01-08 23:58:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1568 [2025-01-08 23:58:58,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:58,271 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 10, 10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2025-01-08 23:58:58,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-08 23:58:58,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:58,476 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:58,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1528863495, now seen corresponding path program 1 times [2025-01-08 23:58:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:58,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539488874] [2025-01-08 23:58:58,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:58,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:58,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1567 statements into 1 equivalence classes. [2025-01-08 23:58:58,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1567 of 1567 statements. [2025-01-08 23:58:58,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:58,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 23:58:58,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-08 23:58:58,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1567 statements into 1 equivalence classes. [2025-01-08 23:58:58,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1567 of 1567 statements. [2025-01-08 23:58:58,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:58,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 23:58:59,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-08 23:58:59,057 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-08 23:58:59,058 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:58:59,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 23:58:59,062 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:59,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:58:59,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:58:59 BoogieIcfgContainer [2025-01-08 23:58:59,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:58:59,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:58:59,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:58:59,325 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:58:59,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:58:24" (3/4) ... [2025-01-08 23:58:59,328 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-08 23:58:59,613 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1565. [2025-01-08 23:58:59,933 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:58:59,934 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:58:59,934 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:58:59,935 INFO L158 Benchmark]: Toolchain (without parser) took 36957.48ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 110.0MB in the beginning and 126.2MB in the end (delta: -16.2MB). Peak memory consumption was 160.6MB. Max. memory is 16.1GB. [2025-01-08 23:58:59,935 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:58:59,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.20ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 78.2MB in the end (delta: 31.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 23:58:59,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.22ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 68.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:58:59,936 INFO L158 Benchmark]: Boogie Preprocessor took 101.92ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 56.9MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:58:59,936 INFO L158 Benchmark]: RCFGBuilder took 1059.42ms. Allocated memory is still 142.6MB. Free memory was 56.9MB in the beginning and 71.3MB in the end (delta: -14.5MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2025-01-08 23:58:59,936 INFO L158 Benchmark]: TraceAbstraction took 34753.17ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 70.5MB in the beginning and 60.6MB in the end (delta: 9.8MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. [2025-01-08 23:58:59,936 INFO L158 Benchmark]: Witness Printer took 609.36ms. Allocated memory is still 226.5MB. Free memory was 60.6MB in the beginning and 126.2MB in the end (delta: -65.6MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2025-01-08 23:58:59,937 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.87ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.20ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 78.2MB in the end (delta: 31.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.22ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 68.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.92ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 56.9MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1059.42ms. Allocated memory is still 142.6MB. Free memory was 56.9MB in the beginning and 71.3MB in the end (delta: -14.5MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * TraceAbstraction took 34753.17ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 70.5MB in the beginning and 60.6MB in the end (delta: 9.8MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. * Witness Printer took 609.36ms. Allocated memory is still 226.5MB. Free memory was 60.6MB in the beginning and 126.2MB in the end (delta: -65.6MB). Peak memory consumption was 28.9MB. 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: 62]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputD = 4; [L18] int inputB = 2; [L19] int inputC = 3; [L20] int inputF = 6; [L21] int inputE = 5; [L22] int inputA = 1; [L25] int a21 = 7; [L26] int a15 = 8; [L27] int a12 = -49; [L28] int a24 = 1; VAL [a12=-49, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L887] int output = -1; VAL [a12=-49, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=-49, a15=8, a21=7, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L461] a21 = 10 [L463] return 22; VAL [\result=22, a12=-49, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-49, a15=8, a21=10, a24=1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND TRUE ((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8)) [L455] a12 = ((((a12 % 26)+ -1) / 5) / 5) [L456] a21 = 7 [L458] return 25; VAL [\result=25, a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=0, a15=8, a21=7, a24=1, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND TRUE (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8)) [L502] a21 = 9 [L504] return 21; VAL [\result=21, a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=0, a15=8, a21=9, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND TRUE (((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1)) [L287] a21 = 10 [L289] return 24; VAL [\result=24, a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L636] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L648] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L660] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L666] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L684] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L687] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L693] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L710] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L734] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L740] COND FALSE !(((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((a15==8) && (( ((-43 < a12) && (11 >= a12)) && ((a21==9) && (input == 4))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !((( a12 <= -43 && ((((a21==10) || ((a21==8) || (a21==9))) && (input == 4)) && (a15==8))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a24==1) && ((a15==8) && ((input == 4) && (( 80 < a12 && (a21==7)) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L762] COND FALSE !(( ((11 < a12) && (80 >= a12)) && ((a15==8) && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L768] COND FALSE !(((((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9)))) && (input == 4)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !((((a15==8) && (((( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6))) || ( 80 < a12 && (a21==7))) && (input == 5))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !(((a21==9) && ((((input == 6) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L793] COND FALSE !(((a24==1) && ((a21==9) && ( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (input == 3)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a15==9) && (((input == 3) && (((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L805] COND FALSE !(( a12 <= -43 && ((a21==7) && ((a24==1) && ((a15==8) && (input == 6)))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L811] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((((input == 3) && (a24==1)) && (a21==8)) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((((a24==2) && a12 <= -43 ) && (a15==5)) && (a21==6))) && (input == 5))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((a21==7) || (a21==8)) && (input == 5)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L829] COND FALSE !(((((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 1)) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 6)) && (a15==9))))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(((a24==1) && (((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))) && (input == 1)) && (a15==8)))) VAL [a12=0, a15=8, a21=10, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND TRUE (((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 5))) && (a24==1)) [L848] a12 = (((((a12 - -338613) - -126296) * 1) % 34)- -42) [L849] a21 = 9 [L851] return 25; VAL [\result=25, a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=69, a15=8, a21=9, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND TRUE (((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) [L258] a12 = (((a12 - -334333) + 32000) / 5) [L259] a21 = 8 [L261] return 22; VAL [\result=22, a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L636] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L648] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L660] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L666] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L684] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L687] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L693] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L710] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L734] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L740] COND FALSE !(((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((a15==8) && (( ((-43 < a12) && (11 >= a12)) && ((a21==9) && (input == 4))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !((( a12 <= -43 && ((((a21==10) || ((a21==8) || (a21==9))) && (input == 4)) && (a15==8))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a24==1) && ((a15==8) && ((input == 4) && (( 80 < a12 && (a21==7)) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L762] COND FALSE !(( ((11 < a12) && (80 >= a12)) && ((a15==8) && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L768] COND FALSE !(((((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9)))) && (input == 4)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !((((a15==8) && (((( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6))) || ( 80 < a12 && (a21==7))) && (input == 5))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !(((a21==9) && ((((input == 6) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L793] COND FALSE !(((a24==1) && ((a21==9) && ( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (input == 3)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a15==9) && (((input == 3) && (((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L805] COND FALSE !(( a12 <= -43 && ((a21==7) && ((a24==1) && ((a15==8) && (input == 6)))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L811] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((((input == 3) && (a24==1)) && (a21==8)) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((((a24==2) && a12 <= -43 ) && (a15==5)) && (a21==6))) && (input == 5))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((a21==7) || (a21==8)) && (input == 5)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L829] COND FALSE !(((((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 1)) && (a15==8)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 6)) && (a15==9))))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(((a24==1) && (((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))) && (input == 1)) && (a15==8)))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 5))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L852] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 6) && ((a21==9) || (a21==10))) && (a24==1))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L858] COND TRUE ((a15==8) && ( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 5))))) [L859] a12 = (((a12 + -600079) - -316691) - 316661) [L860] a15 = 9 [L861] a21 = 8 [L863] return 26; VAL [\result=26, a12=-526769, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=-526769, a15=9, a21=8, a24=1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND TRUE (((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9)) [L507] a21 = 10 [L509] return 22; VAL [\result=22, a12=-526769, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-526769, a15=9, a21=10, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND TRUE ((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1)) [L632] a12 = (((((a12 % 26)- 16) + 343661) - 46416) - 297244) [L633] a21 = 8 [L635] return 25; VAL [\result=25, a12=-24, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L636] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L648] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L660] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L666] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L684] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L687] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L693] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L710] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L734] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L740] COND FALSE !(((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((a15==8) && (( ((-43 < a12) && (11 >= a12)) && ((a21==9) && (input == 4))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !((( a12 <= -43 && ((((a21==10) || ((a21==8) || (a21==9))) && (input == 4)) && (a15==8))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a24==1) && ((a15==8) && ((input == 4) && (( 80 < a12 && (a21==7)) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L762] COND FALSE !(( ((11 < a12) && (80 >= a12)) && ((a15==8) && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L768] COND FALSE !(((((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9)))) && (input == 4)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !((((a15==8) && (((( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6))) || ( 80 < a12 && (a21==7))) && (input == 5))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !(((a21==9) && ((((input == 6) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L793] COND FALSE !(((a24==1) && ((a21==9) && ( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (input == 3)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a15==9) && (((input == 3) && (((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )))) && (a24==1)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L805] COND FALSE !(( a12 <= -43 && ((a21==7) && ((a24==1) && ((a15==8) && (input == 6)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L811] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((((input == 3) && (a24==1)) && (a21==8)) && (a15==9)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((((a24==2) && a12 <= -43 ) && (a15==5)) && (a21==6))) && (input == 5))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((a21==7) || (a21==8)) && (input == 5)))) && (a15==8))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L829] COND FALSE !(((((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 1)) && (a15==8)) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 6)) && (a15==9))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(((a24==1) && (((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))) && (input == 1)) && (a15==8)))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 5))) && (a24==1))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L852] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 6) && ((a21==9) || (a21==10))) && (a24==1))) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L858] COND FALSE !(((a15==8) && ( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 5)))))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L864] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 5)))) && 80 < a12 )) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !((((((input == 5) && ((-43 < a12) && (11 >= a12)) ) && (a21==8)) && (a24==1)) && (a15==9))) VAL [a12=-24, a15=9, a21=8, a24=1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND TRUE ((a15==9) && ((((input == 4) && (a24==1)) && (a21==8)) && ((-43 < a12) && (11 >= a12)) )) [L877] a21 = 10 [L879] return 22; VAL [\result=22, a12=-24, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=-24, a15=9, a21=10, a24=1, input=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) [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=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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, 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=37, a15=9, a21=8, a24=1, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND TRUE ((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) ) [L558] a12 = ((((a12 - -582271) - 436382) - 442400) - -391873) [L559] a21 = 6 [L561] return 22; VAL [\result=22, a12=95399, a15=9, a21=6, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL, EXPR calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, 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=95399, a15=9, a21=6, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND TRUE ((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5)))) [L246] a12 = (((((a12 % 34)+ 23) - -139662) - 547970) - -408298) [L247] a15 = 6 [L248] a21 = 6 [L250] return -1; VAL [\result=-1, a12=42, a15=6, a21=6, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] RET, EXPR calculate_output(input) [L898] output = calculate_output(input) [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L898] CALL calculate_output(input) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=42, a15=6, a21=6, 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=42, a15=6, a21=6, 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=42, a15=6, a21=6, 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=42, a15=6, a21=6, 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=42, a15=6, a21=6, 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=42, a15=6, a21=6, 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=42, a15=6, a21=6, 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=42, a15=6, a21=6, 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=42, a15=6, a21=6, 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=42, a15=6, a21=6, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND TRUE ((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6)) VAL [a12=42, a15=6, a21=6, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] reach_error() VAL [a12=42, a15=6, a21=6, a24=1, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.4s, OverallIterations: 26, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3765 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3765 mSDsluCounter, 2475 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 1657 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15727 IncrementalHoareTripleChecker+Invalid, 17384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1657 mSolverCounterUnsat, 2291 mSDtfsCounter, 15727 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12362 GetRequests, 12281 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5166occurred in iteration=24, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 12106 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 26104 NumberOfCodeBlocks, 26104 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 27706 ConstructedInterpolants, 0 QuantifiedInterpolants, 80086 SizeOfPredicates, 1 NumberOfNonLiveVariables, 11268 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 75817/77641 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-08 23:58:59,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE