/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 15:02:07,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 15:02:08,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 15:02:08,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 15:02:08,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 15:02:08,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 15:02:08,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 15:02:08,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 15:02:08,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 15:02:08,075 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 15:02:08,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 15:02:08,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 15:02:08,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 15:02:08,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 15:02:08,078 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 15:02:08,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 15:02:08,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 15:02:08,079 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 15:02:08,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 15:02:08,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 15:02:08,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 15:02:08,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 15:02:08,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 15:02:08,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 15:02:08,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 15:02:08,081 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 15:02:08,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 15:02:08,082 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 15:02:08,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 15:02:08,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 15:02:08,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 15:02:08,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 15:02:08,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 15:02:08,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 15:02:08,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 15:02:08,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 15:02:08,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 15:02:08,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 15:02:08,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 15:02:08,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 15:02:08,085 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 15:02:08,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 15:02:08,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 15:02:08,086 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 15:02:08,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 15:02:08,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 15:02:08,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 15:02:08,334 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 15:02:08,335 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 15:02:08,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2023-12-20 15:02:09,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 15:02:09,690 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 15:02:09,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2023-12-20 15:02:09,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b0ae156/cc10c2b64f3f436982deb79f2a6ac2a7/FLAGbc06c4427 [2023-12-20 15:02:09,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b0ae156/cc10c2b64f3f436982deb79f2a6ac2a7 [2023-12-20 15:02:09,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 15:02:09,727 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 15:02:09,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 15:02:09,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 15:02:09,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 15:02:09,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 03:02:09" (1/1) ... [2023-12-20 15:02:09,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2d199b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:09, skipping insertion in model container [2023-12-20 15:02:09,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 03:02:09" (1/1) ... [2023-12-20 15:02:09,793 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 15:02:10,059 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label50.c[14631,14644] [2023-12-20 15:02:10,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 15:02:10,147 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 15:02:10,234 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label50.c[14631,14644] [2023-12-20 15:02:10,279 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 15:02:10,291 INFO L206 MainTranslator]: Completed translation [2023-12-20 15:02:10,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10 WrapperNode [2023-12-20 15:02:10,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 15:02:10,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 15:02:10,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 15:02:10,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 15:02:10,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,387 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2023-12-20 15:02:10,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 15:02:10,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 15:02:10,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 15:02:10,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 15:02:10,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,441 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]. [2023-12-20 15:02:10,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 15:02:10,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 15:02:10,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 15:02:10,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 15:02:10,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (1/1) ... [2023-12-20 15:02:10,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 15:02:10,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 15:02:10,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 15:02:10,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 15:02:10,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 15:02:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 15:02:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 15:02:10,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 15:02:10,628 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 15:02:10,631 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 15:02:11,529 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 15:02:11,594 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 15:02:11,595 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 15:02:11,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 03:02:11 BoogieIcfgContainer [2023-12-20 15:02:11,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 15:02:11,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 15:02:11,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 15:02:11,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 15:02:11,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 03:02:09" (1/3) ... [2023-12-20 15:02:11,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7292921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 03:02:11, skipping insertion in model container [2023-12-20 15:02:11,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:02:10" (2/3) ... [2023-12-20 15:02:11,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7292921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 03:02:11, skipping insertion in model container [2023-12-20 15:02:11,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 03:02:11" (3/3) ... [2023-12-20 15:02:11,603 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label50.c [2023-12-20 15:02:11,620 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 15:02:11,621 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 15:02:11,685 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 15:02:11,692 INFO L357 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, mHoare=true, 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;@5ab21788, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 15:02:11,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 15:02:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-20 15:02:11,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 15:02:11,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 15:02:11,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 15:02:11,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 15:02:11,718 INFO L85 PathProgramCache]: Analyzing trace with hash 671389650, now seen corresponding path program 1 times [2023-12-20 15:02:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 15:02:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339885769] [2023-12-20 15:02:11,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 15:02:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 15:02:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 15:02:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 15:02:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 15:02:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339885769] [2023-12-20 15:02:12,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339885769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 15:02:12,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 15:02:12,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 15:02:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404153781] [2023-12-20 15:02:12,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 15:02:12,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 15:02:12,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 15:02:12,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 15:02:12,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 15:02:12,260 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 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 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 15:02:12,875 INFO L93 Difference]: Finished difference Result 483 states and 925 transitions. [2023-12-20 15:02:12,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 15:02:12,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2023-12-20 15:02:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 15:02:12,895 INFO L225 Difference]: With dead ends: 483 [2023-12-20 15:02:12,896 INFO L226 Difference]: Without dead ends: 315 [2023-12-20 15:02:12,900 INFO L412 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 [2023-12-20 15:02:12,903 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 89 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 15:02:12,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 66 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 15:02:12,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-12-20 15:02:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 308. [2023-12-20 15:02:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.4625407166123778) internal successors, (449), 307 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 449 transitions. [2023-12-20 15:02:12,966 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 449 transitions. Word has length 80 [2023-12-20 15:02:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 15:02:12,967 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 449 transitions. [2023-12-20 15:02:12,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 449 transitions. [2023-12-20 15:02:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-20 15:02:12,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 15:02:12,970 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 15:02:12,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 15:02:12,971 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 15:02:12,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 15:02:12,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2145709265, now seen corresponding path program 1 times [2023-12-20 15:02:12,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 15:02:12,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452761360] [2023-12-20 15:02:12,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 15:02:12,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 15:02:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 15:02:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 15:02:13,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 15:02:13,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452761360] [2023-12-20 15:02:13,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452761360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 15:02:13,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 15:02:13,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 15:02:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463095097] [2023-12-20 15:02:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 15:02:13,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 15:02:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 15:02:13,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 15:02:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 15:02:13,062 INFO L87 Difference]: Start difference. First operand 308 states and 449 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 15:02:13,475 INFO L93 Difference]: Finished difference Result 899 states and 1315 transitions. [2023-12-20 15:02:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 15:02:13,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2023-12-20 15:02:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 15:02:13,478 INFO L225 Difference]: With dead ends: 899 [2023-12-20 15:02:13,478 INFO L226 Difference]: Without dead ends: 592 [2023-12-20 15:02:13,479 INFO L412 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 [2023-12-20 15:02:13,481 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 141 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 15:02:13,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 115 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 15:02:13,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2023-12-20 15:02:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 590. [2023-12-20 15:02:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.2937181663837012) internal successors, (762), 589 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 762 transitions. [2023-12-20 15:02:13,498 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 762 transitions. Word has length 88 [2023-12-20 15:02:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 15:02:13,499 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 762 transitions. [2023-12-20 15:02:13,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 762 transitions. [2023-12-20 15:02:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-20 15:02:13,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 15:02:13,502 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 15:02:13,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 15:02:13,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 15:02:13,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 15:02:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1736071171, now seen corresponding path program 1 times [2023-12-20 15:02:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 15:02:13,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315277946] [2023-12-20 15:02:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 15:02:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 15:02:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 15:02:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 15:02:13,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 15:02:13,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315277946] [2023-12-20 15:02:13,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315277946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 15:02:13,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 15:02:13,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 15:02:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053305719] [2023-12-20 15:02:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 15:02:13,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 15:02:13,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 15:02:13,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 15:02:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 15:02:13,618 INFO L87 Difference]: Start difference. First operand 590 states and 762 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 15:02:14,016 INFO L93 Difference]: Finished difference Result 1749 states and 2262 transitions. [2023-12-20 15:02:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 15:02:14,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-12-20 15:02:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 15:02:14,021 INFO L225 Difference]: With dead ends: 1749 [2023-12-20 15:02:14,021 INFO L226 Difference]: Without dead ends: 1160 [2023-12-20 15:02:14,023 INFO L412 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 [2023-12-20 15:02:14,024 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 89 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 15:02:14,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 294 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 15:02:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2023-12-20 15:02:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1013. [2023-12-20 15:02:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.2648221343873518) internal successors, (1280), 1012 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1280 transitions. [2023-12-20 15:02:14,042 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1280 transitions. Word has length 89 [2023-12-20 15:02:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 15:02:14,043 INFO L495 AbstractCegarLoop]: Abstraction has 1013 states and 1280 transitions. [2023-12-20 15:02:14,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1280 transitions. [2023-12-20 15:02:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-20 15:02:14,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 15:02:14,045 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 15:02:14,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 15:02:14,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 15:02:14,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 15:02:14,046 INFO L85 PathProgramCache]: Analyzing trace with hash -722403050, now seen corresponding path program 1 times [2023-12-20 15:02:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 15:02:14,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254472151] [2023-12-20 15:02:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 15:02:14,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 15:02:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 15:02:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 15:02:14,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 15:02:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254472151] [2023-12-20 15:02:14,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254472151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 15:02:14,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 15:02:14,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 15:02:14,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923041259] [2023-12-20 15:02:14,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 15:02:14,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 15:02:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 15:02:14,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 15:02:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 15:02:14,155 INFO L87 Difference]: Start difference. First operand 1013 states and 1280 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 15:02:14,547 INFO L93 Difference]: Finished difference Result 2869 states and 3644 transitions. [2023-12-20 15:02:14,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 15:02:14,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2023-12-20 15:02:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 15:02:14,554 INFO L225 Difference]: With dead ends: 2869 [2023-12-20 15:02:14,554 INFO L226 Difference]: Without dead ends: 1857 [2023-12-20 15:02:14,556 INFO L412 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 [2023-12-20 15:02:14,557 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 188 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 15:02:14,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 79 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 15:02:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2023-12-20 15:02:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1857. [2023-12-20 15:02:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1856 states have (on average 1.224676724137931) internal successors, (2273), 1856 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2273 transitions. [2023-12-20 15:02:14,593 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2273 transitions. Word has length 90 [2023-12-20 15:02:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 15:02:14,593 INFO L495 AbstractCegarLoop]: Abstraction has 1857 states and 2273 transitions. [2023-12-20 15:02:14,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2273 transitions. [2023-12-20 15:02:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-20 15:02:14,597 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 15:02:14,597 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 15:02:14,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 15:02:14,598 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 15:02:14,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 15:02:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1167032866, now seen corresponding path program 1 times [2023-12-20 15:02:14,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 15:02:14,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234543878] [2023-12-20 15:02:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 15:02:14,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 15:02:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 15:02:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 15:02:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 15:02:14,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234543878] [2023-12-20 15:02:14,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234543878] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 15:02:14,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 15:02:14,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 15:02:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112015299] [2023-12-20 15:02:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 15:02:14,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 15:02:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 15:02:14,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 15:02:14,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 15:02:14,776 INFO L87 Difference]: Start difference. First operand 1857 states and 2273 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 15:02:15,178 INFO L93 Difference]: Finished difference Result 4554 states and 5652 transitions. [2023-12-20 15:02:15,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 15:02:15,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 107 [2023-12-20 15:02:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 15:02:15,186 INFO L225 Difference]: With dead ends: 4554 [2023-12-20 15:02:15,186 INFO L226 Difference]: Without dead ends: 2698 [2023-12-20 15:02:15,189 INFO L412 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 [2023-12-20 15:02:15,190 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 15:02:15,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 243 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 15:02:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2023-12-20 15:02:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2698. [2023-12-20 15:02:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 2697 states have (on average 1.1731553578049685) internal successors, (3164), 2697 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3164 transitions. [2023-12-20 15:02:15,230 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3164 transitions. Word has length 107 [2023-12-20 15:02:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 15:02:15,230 INFO L495 AbstractCegarLoop]: Abstraction has 2698 states and 3164 transitions. [2023-12-20 15:02:15,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3164 transitions. [2023-12-20 15:02:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-20 15:02:15,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 15:02:15,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 15:02:15,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 15:02:15,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 15:02:15,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 15:02:15,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2144406681, now seen corresponding path program 1 times [2023-12-20 15:02:15,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 15:02:15,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743425294] [2023-12-20 15:02:15,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 15:02:15,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 15:02:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 15:02:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 15:02:15,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 15:02:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743425294] [2023-12-20 15:02:15,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743425294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 15:02:15,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 15:02:15,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 15:02:15,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027648647] [2023-12-20 15:02:15,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 15:02:15,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 15:02:15,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 15:02:15,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 15:02:15,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 15:02:15,366 INFO L87 Difference]: Start difference. First operand 2698 states and 3164 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 15:02:15,736 INFO L93 Difference]: Finished difference Result 5817 states and 6786 transitions. [2023-12-20 15:02:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 15:02:15,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2023-12-20 15:02:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 15:02:15,744 INFO L225 Difference]: With dead ends: 5817 [2023-12-20 15:02:15,745 INFO L226 Difference]: Without dead ends: 2558 [2023-12-20 15:02:15,750 INFO L412 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 [2023-12-20 15:02:15,753 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 15:02:15,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 59 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 15:02:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2023-12-20 15:02:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2556. [2023-12-20 15:02:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2555 states have (on average 1.1166340508806263) internal successors, (2853), 2555 states have internal predecessors, (2853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 2853 transitions. [2023-12-20 15:02:15,804 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 2853 transitions. Word has length 109 [2023-12-20 15:02:15,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 15:02:15,804 INFO L495 AbstractCegarLoop]: Abstraction has 2556 states and 2853 transitions. [2023-12-20 15:02:15,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 2853 transitions. [2023-12-20 15:02:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-20 15:02:15,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 15:02:15,808 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-20 15:02:15,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 15:02:15,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 15:02:15,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 15:02:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1317466351, now seen corresponding path program 1 times [2023-12-20 15:02:15,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 15:02:15,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243287124] [2023-12-20 15:02:15,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 15:02:15,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 15:02:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 15:02:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-20 15:02:15,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 15:02:15,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243287124] [2023-12-20 15:02:15,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243287124] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 15:02:15,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 15:02:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 15:02:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993273230] [2023-12-20 15:02:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 15:02:15,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 15:02:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 15:02:15,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 15:02:15,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 15:02:15,909 INFO L87 Difference]: Start difference. First operand 2556 states and 2853 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 15:02:16,106 INFO L93 Difference]: Finished difference Result 4533 states and 5064 transitions. [2023-12-20 15:02:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 15:02:16,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 123 [2023-12-20 15:02:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 15:02:16,112 INFO L225 Difference]: With dead ends: 4533 [2023-12-20 15:02:16,112 INFO L226 Difference]: Without dead ends: 1836 [2023-12-20 15:02:16,115 INFO L412 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 [2023-12-20 15:02:16,117 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 15:02:16,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 17 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 15:02:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2023-12-20 15:02:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1836. [2023-12-20 15:02:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1835 states have (on average 1.064850136239782) internal successors, (1954), 1835 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 1954 transitions. [2023-12-20 15:02:16,145 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 1954 transitions. Word has length 123 [2023-12-20 15:02:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 15:02:16,145 INFO L495 AbstractCegarLoop]: Abstraction has 1836 states and 1954 transitions. [2023-12-20 15:02:16,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 1954 transitions. [2023-12-20 15:02:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-20 15:02:16,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 15:02:16,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 15:02:16,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 15:02:16,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 15:02:16,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 15:02:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash -226498775, now seen corresponding path program 1 times [2023-12-20 15:02:16,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 15:02:16,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859108556] [2023-12-20 15:02:16,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 15:02:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 15:02:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 15:02:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 15:02:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 15:02:16,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859108556] [2023-12-20 15:02:16,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859108556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 15:02:16,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 15:02:16,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 15:02:16,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531568743] [2023-12-20 15:02:16,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 15:02:16,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 15:02:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 15:02:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 15:02:16,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 15:02:16,296 INFO L87 Difference]: Start difference. First operand 1836 states and 1954 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 15:02:16,641 INFO L93 Difference]: Finished difference Result 3530 states and 3767 transitions. [2023-12-20 15:02:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 15:02:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2023-12-20 15:02:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 15:02:16,648 INFO L225 Difference]: With dead ends: 3530 [2023-12-20 15:02:16,649 INFO L226 Difference]: Without dead ends: 2115 [2023-12-20 15:02:16,651 INFO L412 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 [2023-12-20 15:02:16,651 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 128 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 15:02:16,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 29 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 15:02:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2023-12-20 15:02:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1975. [2023-12-20 15:02:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1974 states have (on average 1.0623100303951367) internal successors, (2097), 1974 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2097 transitions. [2023-12-20 15:02:16,687 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2097 transitions. Word has length 152 [2023-12-20 15:02:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 15:02:16,687 INFO L495 AbstractCegarLoop]: Abstraction has 1975 states and 2097 transitions. [2023-12-20 15:02:16,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2097 transitions. [2023-12-20 15:02:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-20 15:02:16,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 15:02:16,691 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 15:02:16,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 15:02:16,691 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 15:02:16,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 15:02:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash 11573305, now seen corresponding path program 1 times [2023-12-20 15:02:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 15:02:16,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588066420] [2023-12-20 15:02:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 15:02:16,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 15:02:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 15:02:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-20 15:02:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 15:02:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588066420] [2023-12-20 15:02:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588066420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 15:02:16,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 15:02:16,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 15:02:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078897509] [2023-12-20 15:02:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 15:02:16,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 15:02:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 15:02:16,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 15:02:16,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 15:02:16,820 INFO L87 Difference]: Start difference. First operand 1975 states and 2097 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 15:02:17,137 INFO L93 Difference]: Finished difference Result 3669 states and 3907 transitions. [2023-12-20 15:02:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 15:02:17,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2023-12-20 15:02:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 15:02:17,142 INFO L225 Difference]: With dead ends: 3669 [2023-12-20 15:02:17,143 INFO L226 Difference]: Without dead ends: 1415 [2023-12-20 15:02:17,147 INFO L412 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 [2023-12-20 15:02:17,149 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 95 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 15:02:17,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 204 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 15:02:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2023-12-20 15:02:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1415. [2023-12-20 15:02:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1414 states have (on average 1.0495049504950495) internal successors, (1484), 1414 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1484 transitions. [2023-12-20 15:02:17,179 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1484 transitions. Word has length 167 [2023-12-20 15:02:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 15:02:17,180 INFO L495 AbstractCegarLoop]: Abstraction has 1415 states and 1484 transitions. [2023-12-20 15:02:17,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 15:02:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1484 transitions. [2023-12-20 15:02:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-20 15:02:17,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 15:02:17,183 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 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] [2023-12-20 15:02:17,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 15:02:17,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 15:02:17,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 15:02:17,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2107099117, now seen corresponding path program 1 times [2023-12-20 15:02:17,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 15:02:17,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570732075] [2023-12-20 15:02:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 15:02:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 15:02:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 15:02:17,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 15:02:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 15:02:17,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 15:02:17,338 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 15:02:17,339 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 15:02:17,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 15:02:17,343 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 15:02:17,347 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 15:02:17,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 03:02:17 BoogieIcfgContainer [2023-12-20 15:02:17,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 15:02:17,482 INFO L158 Benchmark]: Toolchain (without parser) took 7754.72ms. Allocated memory was 179.3MB in the beginning and 392.2MB in the end (delta: 212.9MB). Free memory was 117.5MB in the beginning and 141.2MB in the end (delta: -23.7MB). Peak memory consumption was 189.8MB. Max. memory is 8.0GB. [2023-12-20 15:02:17,482 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 15:02:17,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.22ms. Allocated memory was 179.3MB in the beginning and 295.7MB in the end (delta: 116.4MB). Free memory was 117.2MB in the beginning and 258.3MB in the end (delta: -141.0MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-20 15:02:17,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.98ms. Allocated memory is still 295.7MB. Free memory was 258.3MB in the beginning and 253.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 15:02:17,483 INFO L158 Benchmark]: Boogie Preprocessor took 110.47ms. Allocated memory is still 295.7MB. Free memory was 253.0MB in the beginning and 247.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-20 15:02:17,485 INFO L158 Benchmark]: RCFGBuilder took 1090.17ms. Allocated memory is still 295.7MB. Free memory was 247.2MB in the beginning and 167.0MB in the end (delta: 80.2MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. [2023-12-20 15:02:17,486 INFO L158 Benchmark]: TraceAbstraction took 5883.88ms. Allocated memory was 295.7MB in the beginning and 392.2MB in the end (delta: 96.5MB). Free memory was 166.5MB in the beginning and 141.2MB in the end (delta: 25.3MB). Peak memory consumption was 121.6MB. Max. memory is 8.0GB. [2023-12-20 15:02:17,487 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.12ms. Allocated memory is still 179.3MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 568.22ms. Allocated memory was 179.3MB in the beginning and 295.7MB in the end (delta: 116.4MB). Free memory was 117.2MB in the beginning and 258.3MB in the end (delta: -141.0MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 95.98ms. Allocated memory is still 295.7MB. Free memory was 258.3MB in the beginning and 253.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 110.47ms. Allocated memory is still 295.7MB. Free memory was 253.0MB in the beginning and 247.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1090.17ms. Allocated memory is still 295.7MB. Free memory was 247.2MB in the beginning and 167.0MB in the end (delta: 80.2MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5883.88ms. Allocated memory was 295.7MB in the beginning and 392.2MB in the end (delta: 96.5MB). Free memory was 166.5MB in the beginning and 141.2MB in the end (delta: 25.3MB). Peak memory consumption was 121.6MB. Max. memory is 8.0GB. * 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: 425]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [\old(input)=4, \result=23, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [\old(input)=3, \result=25, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L65] a28 = 7 [L66] a11 = 1 [L67] a25 = 0 [L68] return -1; VAL [\old(input)=1, \result=-1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L425] reach_error() VAL [\old(input)=5, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1144 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1144 mSDsluCounter, 1106 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 530 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2993 IncrementalHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 530 mSolverCounterUnsat, 986 mSDtfsCounter, 2993 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2698occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 298 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1215 NumberOfCodeBlocks, 1215 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 996 ConstructedInterpolants, 0 QuantifiedInterpolants, 1803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 394/394 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-20 15:02:17,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...